Feodor F. Dragan. Estimating all pairs shortest paths in restricted graph families: a unified approach. J. Algorithms, 57(1):1-21, 2005. [doi]
@article{Dragan05:0,
title = {Estimating all pairs shortest paths in restricted graph families: a unified approach},
author = {Feodor F. Dragan},
year = {2005},
doi = {10.1016/j.jalgor.2004.09.002},
url = {http://dx.doi.org/10.1016/j.jalgor.2004.09.002},
tags = {graph-rewriting, rewriting, systematic-approach},
researchr = {https://researchr.org/publication/Dragan05%3A0},
cites = {0},
citedby = {0},
journal = {J. Algorithms},
volume = {57},
number = {1},
pages = {1-21},
}