Title of article :
A simple linear algorithm for the edge-disjoint (s, t)-paths problem in undirected planar graphs
Author/Authors :
Laurent Coupry، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1997
Keywords :
Algorithms , Residual graph , Clockwise andcounterclockwise circuit , planar graphs , Edge-disjoint paths , Flow , Combinatorial problems
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters
