مرکز منطقه ای اطلاع رساني علوم و فناوري - A note of an O(n3/logn) time algorithm for all pairs shortest paths

Title of article :

A note of an O(n3/logn) time algorithm for all pairs shortest paths

Author/Authors :

Yijie Han، نويسنده ,

Issue Information :

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

Pages :

From page :

114

To page :

116

Keywords :

graph algorithms , complexity , Shortest path , analysis of algorithms

Journal title :

Information Processing Letters

Serial Year :

2007

Journal title :

Information Processing Letters

Record number :

130542

Link To Document :