Abstract
We consider the following problem. LetG=(V,E) be an undirected planar graph and lets,t∈V,s≠t. The problem is to find a set of pairwise edge-disjoint paths inG, each connectingswitht, of maximum cardinality. In other words, the problem is to find a maximum unit flow fromstot. The fastest algorithm in the literature has running time O(|V|log|V|). We give a linear time algorithm in this paper.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
