مرکز منطقه ای اطلاع رساني علوم و فناوري - Path-based depth-first search for strong and biconnected components

Title of article :

Path-based depth-first search for strong and biconnected components

Author/Authors :

Harold N. Gabow، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 2000

Pages :

From page :

107

To page :

114

Keywords :

Strongly connected component , Stack , Biconnected component , Algorithms , graph , Depth-first search

Journal title :

Information Processing Letters

Serial Year :

2000

Journal title :

Information Processing Letters

Record number :

129216

Link To Document :