مرکز منطقه ای اطلاع رساني علوم و فناوري - Solving the shortest-paths problem on bipartite permutation graphs efficiently

Title of article :

Solving the shortest-paths problem on bipartite permutation graphs efficiently

Author/Authors :

Lin Chen، نويسنده ,

Issue Information :

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

Pages :

From page :

259

To page :

264

Keywords :

Parallel algorithms: Shortest paths: Bipartite permutation graphs: Upper and lower bounds

Journal title :

Information Processing Letters

Serial Year :

1995

Journal title :

Information Processing Letters

Record number :

128330

Link To Document :