Finding an induced path of given parity in planar graphs in polynomial time
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A trichotomy for regular simple path queries on graphs
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
In this paper we show that the following problem, the even simple path (ESP) problem for directed planar graphs, is solvable in polynomial time:Given: a directed planar graph G=(V,E) and two nodes s, (starting node), t ,(targetnode) \in V; Find: a simple path (i.e., without repeated nodes) from s to t of even length. (The length of the path is the number of edges it contains.)