Results 281 to 290 of about 524,063 (295)
Some of the next articles are maybe not open access.
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM, 2002Uri Zwick
exaly
Finding the K shortest paths in a schedule-based transit network
Computers and Operations Research, 2012Ato Xu, Sohail Chaudhry
exaly
Computing homotopic shortest paths efficiently
Computational Geometry: Theory and Applications, 2006Stephen Kobourov, Anna Lubiw
exaly
Path enumeration by finding the constrained K-shortest paths
Transportation Research Part B: Methodological, 2005exaly
Replacement paths and k simple shortest paths in unweighted directed graphs
ACM Transactions on Algorithms, 2012Uri Zwick, Liam Roditty
exaly
Partially Disjoint Shortest Paths and Near-Shortest Paths Trees
Yefim Dinitz +3 moreopenaire +1 more source
An O(n3loglogn/log2n) time algorithm for all pairs shortest paths
Journal of Discrete Algorithms, 2016Yijie Han, Tadao Takaoka
exaly

