مرکز منطقه ای اطلاع رساني علوم و فناوري - An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem

Title of article :

An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem

Author/Authors :

Tadao Takaoka، نويسنده ,

Issue Information :

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

Pages :

From page :

155

To page :

161

Keywords :

graph algorithms , Divide and conquer , Shortest path

Journal title :

Information Processing Letters

Serial Year :

2005

Journal title :

Information Processing Letters

Record number :

130161

Link To Document :