Feodor F. Dragan. Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach. In Andreas Brandstädt, Van Bang Le, editors, Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings. Volume 2204 of Lecture Notes in Computer Science, pages 103-116, Springer, 2001. [doi]
Abstract is missing.