Go to the corresponding LIPIcs Volume Portal 
Casteigts, Arnaud ; Corsini, TimothĂ©e ; Hocquard, HervĂ© ; Labourel, Arnaud
pdfformat: 

@InProceedings{casteigts_et_al:LIPIcs.SAND.2022.9, author = {Casteigts, Arnaud and Corsini, Timoth\'{e}e and Hocquard, Herv\'{e} and Labourel, Arnaud}, title = {{Robustness of Distances and Diameter in a Fragile Network}}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)}, pages = {9:19:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772242}, ISSN = {18688969}, year = {2022}, volume = {221}, editor = {Aspnes, James and Michail, Othon}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/15951}, URN = {urn:nbn:de:0030drops159514}, doi = {10.4230/LIPIcs.SAND.2022.9}, annote = {Keywords: Dynamic networks, Longest path, Seriesparallel graphs, Rooted minors} }
Keywords:  Dynamic networks, Longest path, Seriesparallel graphs, Rooted minors  
Collection:  1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022)  
Issue Date:  2022  
Date of publication:  29.04.2022 