EvenPath in directed single-crossing graphs

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Processing Letters Pub Date : 2026-04-01 Epub Date: 2025-11-26 DOI:10.1016/j.ipl.2025.106613

Archit Chauhan , Chetan Gupta , Vimal Raj Sharma

{"title":"EvenPath in directed single-crossing graphs","authors":"Archit Chauhan , Chetan Gupta , Vimal Raj Sharma","doi":"10.1016/j.ipl.2025.106613","DOIUrl":null,"url":null,"abstract":"<div><div>Given a directed graph G and two of its vertices s and t, the EvenPath problem is to find an even-length path from s to t. The decision version of EvenPath problem for general directed graphs was shown to be NP-<math><mi>complete</mi></math> by LaPaugh and Papadimitriou [1]. Thus, it makes sense to discover the classes of graphs for which the EvenPath problem can be solved efficiently. The EvenPath problem for directed planar graphs and directed single-crossing-minor-free graphs is known to be solvable in polynomial-time [2, 3]. In our work, we extend the classes of graphs for which the EvenPath problem can be solved in polynomial-time to directed single-crossing graphs. Our polynomial-time algorithm essentially reduces the EvenPath problem for a directed single-crossing graph to several instances of the EvenPath problem and 3-DisjointPaths problem for directed planar graphs.</div></div>","PeriodicalId":56290,"journal":{"name":"Information Processing Letters","volume":"193 ","pages":"Article 106613"},"PeriodicalIF":0.6000,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Processing Letters","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0020019025000572","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/11/26 0:00:00","PubModel":"Epub","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

Given a directed graph G and two of its vertices s and t, the EvenPath problem is to find an even-length path from s to t. The decision version of EvenPath problem for general directed graphs was shown to be NP-

complete

by LaPaugh and Papadimitriou [1]. Thus, it makes sense to discover the classes of graphs for which the EvenPath problem can be solved efficiently. The EvenPath problem for directed planar graphs and directed single-crossing-minor-free graphs is known to be solvable in polynomial-time [2, 3]. In our work, we extend the classes of graphs for which the EvenPath problem can be solved in polynomial-time to directed single-crossing graphs. Our polynomial-time algorithm essentially reduces the EvenPath problem for a directed single-crossing graph to several instances of the EvenPath problem and 3-DisjointPaths problem for directed planar graphs.

查看原文本刊更多论文

有向单交图中的偶径

给定一个有向图G和它的两个顶点s和t， EvenPath问题是寻找一条从s到t的偶数长度的路径。一般有向图的EvenPath问题的决策版本由LaPaugh和Papadimitriou[1]证明是np完全的。因此，发现能有效解决偶数路径问题的图的类别是有意义的。已知有向平面图和有向单交无次图的偶数路径问题在多项式时间内可解[2,3]。在我们的工作中，我们将偶数路径问题可以在多项式时间内解决的图类扩展到有向单交图。我们的多项式时间算法本质上将有向单交叉图的偶数路径问题简化为有向平面图的偶数路径问题和3-DisjointPaths问题的几个实例。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information Processing Letters 工程技术-计算机：信息系统

CiteScore

1.80

自引率

0.00%

发文量

审稿时长

7.3 months

期刊介绍： Information Processing Letters invites submission of original research articles that focus on fundamental aspects of information processing and computing. This naturally includes work in the broadly understood field of theoretical computer science; although papers in all areas of scientific inquiry will be given consideration, provided that they describe research contributions credibly motivated by applications to computing and involve rigorous methodology. High quality experimental papers that address topics of sufficiently broad interest may also be considered. Since its inception in 1971, Information Processing Letters has served as a forum for timely dissemination of short, concise and focused research contributions. Continuing with this tradition, and to expedite the reviewing process, manuscripts are generally limited in length to nine pages when they appear in print.