Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Etienne Birmelé, Fabien de Montgolfier, Léo Planche, and Laurent Viennot. Decomposing a Graph into Shortest Paths with Bounded Eccentricity. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 15:1-15:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{birmele_et_al:LIPIcs.ISAAC.2017.15, author = {Birmel\'{e}, Etienne and de Montgolfier, Fabien and Planche, L\'{e}o and Viennot, Laurent}, title = {{Decomposing a Graph into Shortest Paths with Bounded Eccentricity}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {15:1--15:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.15}, URN = {urn:nbn:de:0030-drops-82621}, doi = {10.4230/LIPIcs.ISAAC.2017.15}, annote = {Keywords: Graph Decomposition, Graph Clustering, Distance Labeling, BFS, MESP} }
Feedback for Dagstuhl Publishing