Go to the corresponding LIPIcs Volume Portal 
Saranurak, Thatchaphol ; Yuan, Wuwei
pdfformat: 

@InProceedings{saranurak_et_al:LIPIcs.ESA.2023.92, author = {Saranurak, Thatchaphol and Yuan, Wuwei}, title = {{Maximal kEdgeConnected Subgraphs in AlmostLinear Time for Small k}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {92:192:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772952}, ISSN = {18688969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and FarachColton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18745}, URN = {urn:nbn:de:0030drops187451}, doi = {10.4230/LIPIcs.ESA.2023.92}, annote = {Keywords: Graph algorithms, Maximal kedgeconnected subgraphs, Dynamic kedge connectivity} }
Keywords:  Graph algorithms, Maximal kedgeconnected subgraphs, Dynamic kedge connectivity  
Collection:  31st Annual European Symposium on Algorithms (ESA 2023)  
Issue Date:  2023  
Date of publication:  30.08.2023 