A Heuristic for Dijkstra’s Algorithm with Many Targets and Its Use in Weighted Matching Algorithms
- 17 August 2001
- book chapter
- Published by Springer Nature
- p. 242-253
- https://doi.org/10.1007/3-540-44676-1_20
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Efficient algorithms for finding maximum matching in graphsACM Computing Surveys, 1986