共 50 条
- [32] Efficient parallel algorithms for computing all pair shortest paths in directed graphs Algorithmica, 1997, 17 : 399 - 415
- [34] Linear time algorithms for two disjoint paths problems on directed acyclic graphs Theor Comput Sci, (35-48):
- [35] Efficient parallel algorithms for computing all pair shortest paths in directed graphs Algorithmica (New York), 4 (399):
- [36] Logspace algorithms for computing shortest and longest paths in series-parallel graphs FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 216 - 227
- [37] Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs Algorithmica, 2013, 66 : 615 - 640
- [38] ACOhg: Dealing with Huge Graphs GECCO 2007: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2007, : 10 - 17
- [40] Searching paths of constant bandwidth SOFSEM 2006: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2006, 3831 : 187 - 196