@InProceedings{georgiadis_et_al:LIPIcs.ESA.2022.60,
author = {Georgiadis, Loukas and Italiano, Giuseppe F. and Kosinas, Evangelos},
title = {{Computing the 4-Edge-Connected Components of a Graph: An Experimental Study}},
booktitle = {30th Annual European Symposium on Algorithms (ESA 2022)},
pages = {60:1--60:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-247-1},
ISSN = {1868-8969},
year = {2022},
volume = {244},
editor = {Chechik, Shiri and Navarro, Gonzalo and Rotenberg, Eva 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.2022.60},
URN = {urn:nbn:de:0030-drops-169988},
doi = {10.4230/LIPIcs.ESA.2022.60},
annote = {Keywords: Connectivity Cuts, Edge Connectivity, Graph Algorithms}
}