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
Pages
4
From page
83
To page
86
Keywords
Algorithms , Residual graph , Clockwise andcounterclockwise circuit , planar graphs , Edge-disjoint paths , Flow , Combinatorial problems
Journal title
Information Processing Letters
Serial Year
1997
Journal title
Information Processing Letters
Record number
128772
Link To Document