Cyril Gavoille, David Peleg. The Compactness of Interval Routing for Almost All Graphs. SIAM Journal on Computing, 31(3):706-721, 2001. [doi]
@article{GavoilleP01:0,
title = {The Compactness of Interval Routing for Almost All Graphs},
author = {Cyril Gavoille and David Peleg},
year = {2001},
url = {http://epubs.siam.org/sam-bin/dbq/article/35171},
tags = {graph-rewriting, rewriting, routing},
researchr = {https://researchr.org/publication/GavoilleP01%3A0},
cites = {0},
citedby = {0},
journal = {SIAM Journal on Computing},
volume = {31},
number = {3},
pages = {706-721},
}