Published in: LIPIcs, Volume 204, 29th Annual European Symposium on Algorithms (ESA 2021)
Wojciech Nadara, Mateusz Radecki, Marcin Smulewicz, and Marek Sokołowski. Determining 4-Edge-Connected Components in Linear Time. In 29th Annual European Symposium on Algorithms (ESA 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 204, pp. 71:1-71:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{nadara_et_al:LIPIcs.ESA.2021.71,
author = {Nadara, Wojciech and Radecki, Mateusz and Smulewicz, Marcin and Soko{\l}owski, Marek},
title = {{Determining 4-Edge-Connected Components in Linear Time}},
booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)},
pages = {71:1--71:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-204-4},
ISSN = {1868-8969},
year = {2021},
volume = {204},
editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.71},
URN = {urn:nbn:de:0030-drops-146523},
doi = {10.4230/LIPIcs.ESA.2021.71},
annote = {Keywords: graphs, connectivity, cuts}
}
Feedback for Dagstuhl Publishing