{"quality_controlled":"1","date_updated":"2025-01-27T14:56:49Z","title":"Computing the 3-edge-connected components of directed graphs in linear time","date_published":"2024-10-01T00:00:00Z","_id":"18922","type":"conference","publication":"65th Annual Symposium on Foundations of Computer Science","publisher":"IEEE","citation":{"ieee":"L. Georgiadis, G. F. Italiano, and E. Kosinas, “Computing the 3-edge-connected components of directed graphs in linear time,” in <i>65th Annual Symposium on Foundations of Computer Science</i>, Chicago, IL, United States, 2024, pp. 62–85.","chicago":"Georgiadis, Loukas, Giuseppe F. Italiano, and Evangelos Kosinas. “Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time.” In <i>65th Annual Symposium on Foundations of Computer Science</i>, 62–85. IEEE, 2024. <a href=\"https://doi.org/10.1109/focs61266.2024.00015\">https://doi.org/10.1109/focs61266.2024.00015</a>.","apa":"Georgiadis, L., Italiano, G. F., &#38; Kosinas, E. (2024). Computing the 3-edge-connected components of directed graphs in linear time. In <i>65th Annual Symposium on Foundations of Computer Science</i> (pp. 62–85). Chicago, IL, United States: IEEE. <a href=\"https://doi.org/10.1109/focs61266.2024.00015\">https://doi.org/10.1109/focs61266.2024.00015</a>","mla":"Georgiadis, Loukas, et al. “Computing the 3-Edge-Connected Components of Directed Graphs in Linear Time.” <i>65th Annual Symposium on Foundations of Computer Science</i>, IEEE, 2024, pp. 62–85, doi:<a href=\"https://doi.org/10.1109/focs61266.2024.00015\">10.1109/focs61266.2024.00015</a>.","short":"L. Georgiadis, G.F. Italiano, E. Kosinas, in:, 65th Annual Symposium on Foundations of Computer Science, IEEE, 2024, pp. 62–85.","ista":"Georgiadis L, Italiano GF, Kosinas E. 2024. Computing the 3-edge-connected components of directed graphs in linear time. 65th Annual Symposium on Foundations of Computer Science. FOCS: Symposium on Foundations of Computer Science, 62–85.","ama":"Georgiadis L, Italiano GF, Kosinas E. Computing the 3-edge-connected components of directed graphs in linear time. In: <i>65th Annual Symposium on Foundations of Computer Science</i>. IEEE; 2024:62-85. doi:<a href=\"https://doi.org/10.1109/focs61266.2024.00015\">10.1109/focs61266.2024.00015</a>"},"oa_version":"None","conference":{"end_date":"2024-10-30","start_date":"2024-10-27","name":"FOCS: Symposium on Foundations of Computer Science","location":"Chicago, IL, United States"},"corr_author":"1","abstract":[{"lang":"eng","text":"Let G be a directed graph with m edges and n vertices. We present a deterministic linear-time algorithm for computing the 3-edge-connected components of G. This is a significant improvement over the previous best bound by Georgiadis et al. [SODA 2023], which is Õ(m√{m}) and randomized. Our result is based on a novel characterization of 2-edge cuts in directed graphs and on a new technique that exploits the concept of divergent spanning trees and 2-connectivity-light graphs, and requires a careful modification of the minset-poset technique of Gabow [TALG 2016]. As a side result, our new technique yields also an oracle for providing in constant time a minimum edge-cut for any two vertices that are not 3-edge-connected. The oracle uses space O(n) and can be built in O(mlog n) time: given two query vertices, it determines in constant time whether they are 3-edge-connected, or provides a k-edge cut, with k≤ 2, that separates them."}],"author":[{"last_name":"Georgiadis","first_name":"Loukas","full_name":"Georgiadis, Loukas"},{"full_name":"Italiano, Giuseppe F.","first_name":"Giuseppe F.","last_name":"Italiano"},{"first_name":"Evangelos","last_name":"Kosinas","full_name":"Kosinas, Evangelos","id":"4c7f9625-dbbc-11ee-9d86-bdcc2db5a949"}],"acknowledgement":"Giuseppe F. Italiano was partially supported by the Italian Ministry of\r\nUniversity and Reseach under PRIN Project n. 2022TS4Y3N - EXPAND: scalable algorithms for EXPloratory Analyses of heterogeneous and dynamic Networked Data.\r\n","page":"62-85","date_created":"2025-01-27T14:50:23Z","doi":"10.1109/focs61266.2024.00015","department":[{"_id":"MoHe"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9798331516741"]},"article_processing_charge":"No","OA_type":"closed access","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","year":"2024","status":"public","month":"10","day":"01"}