مرکز منطقه ای اطلاع رساني علوم و فناوري - A simplified correctness proof for a well-known algorithm computing strongly connected components

Title of article :

A simplified correctness proof for a well-known algorithm computing strongly connected components

Author/Authors :

Ingo Wegener، نويسنده ,

Issue Information :

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

Pages :

From page :

To page :

Keywords :

Graph problems , Algorithms , Depth first search , Strongly connected components

Journal title :

Information Processing Letters

Serial Year :

2002

Journal title :

Information Processing Letters

Record number :

129536

Link To Document :