Publisher
Springer Berlin Heidelberg
Reference59 articles.
1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison Wesley, Reading (1983)
2. Ahuja, R.K., Mehlhorn, K., Orlin, J.B., Tarjan, R.E.: Faster algorithms for the shortest path problem. J. Assoc. Comput. Mach. 37, 213–223 (1990)
3. Althöfer, I.: On optimal realizations of finite metric spaces by graphs. Discrete Comput. Geom. 3, 103–122 (1988)
4. Ausiello, G., Italiano, G.F., Marchetti Spaccamela, A., Nanni, U.: Incremental algorithms for minimal length paths. J. Algorithms 12, 615–638 (1991)
5. Bandelt, H.-J.: Recognition of tree matrices. SIAM J. Discrete Math. 3, 1–6 (1990)