DMCA

All-pairs nearly 2-approximate shortest-paths in O(n² polylog n) time (2005)

by Surender Baswana , Vishrut Goyal , Sandeep Sen
Venue:IN PROCEEDINGS OF 22ND ANNUAL SYMPOSIUM ON THEORETICAL ASPECT OF COMPUTER SCIENCE, VOLUME 3404 OF LNCS
Citations:13 - 6 self