Abstract
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.)
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
