مرکز منطقه ای اطلاع رساني علوم و فناوري - A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs

Title of article :

A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs

Author/Authors :

Shin-ichi Nakayama، نويسنده , , Shigeru Masuyama، نويسنده ,

Issue Information :

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

Pages :

From page :

216

To page :

221

Keywords :

Combinatorial problem , Minimal cut , computational complexity , Algorithms , Edge ranking

Journal title :

Information Processing Letters

Serial Year :

2007

Journal title :

Information Processing Letters

Record number :

130475

Link To Document :