EvenPath in directed single-crossing graphs

DOI10.1016/J.IPL.2025.106613MaRDI QIDQ7227480zbMATH OpenFDO

Authors Archit Chauhan, Chetan Gupta, Vimal Raj Sharma

Publication date 10 April 2026

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IPL.2025.106613

zbMATH Keywords

\textit{EvenPath}graph algorithmsreachability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Finding k Disjoint Paths in a Directed Planar Graph
• Finding an Even Simple Path in a Directed Planar Graph
• scientific article; zbMATH DE number 1559555 (Why is no real title available?)
• Improved bounds for bipartite matching on surfaces
• Planarity testing revisited
• Simultaneous time-space upper bounds for red-blue path problem in planar DAGs
• The even-path problem for graphs and digraphs
• The shortest even cycle problem is tractable

This page was built for publication: EvenPath in directed single-crossing graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7227480)