2026-07-24T10:07:21Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7407 2024-03-12T11:58:27Z ddc:004 open_access

Edge-Orders Schlipf, Lena Schmidt, Jens M. edge-order st-edge-order canonical ordering edge-independent spanning tree Mondshein sequence linear time Canonical orderings and their relatives such as st-numberings have been used as a key tool in algorithmic graph theory for the last decades. Recently, a unifying link behind all these orders has been shown that links them to well-known graph decompositions into parts that have a prescribed vertex-connectivity. Despite extensive interest in canonical orderings, no analogue of this unifying concept is known for edge-connectivity. In this paper, we establish such a concept named edge-orders and show how to compute (1,1)-edge-orders of 2-edge-connected graphs as well as (2,1)-edge-orders of 3-edge-connected graphs in linear time, respectively. While the former can be seen as the edge-variants of st-numberings, the latter are the edge-variants of Mondshein sequences and non-separating ear decompositions. The methods that we use for obtaining such edge-orders differ considerably in almost all details from the ones used for their vertex-counterparts, as different graph-theoretic constructions are used in the inductive proof and standard reductions from edge- to vertex-connectivity are bound to fail. As a first application, we consider the famous Edge-Independent Spanning Tree Conjecture, which asserts that every k-edge-connected graph contains k rooted spanning trees that are pairwise edge-independent. We illustrate the impact of the above edge-orders by deducing algorithms that construct 2- and 3-edge independent spanning trees of 2- and 3-edge-connected graphs, the latter of which improves the best known running time from O(n^2) to linear time. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Lena Schlipf and Jens M. Schmidt 2017 Is Part Of LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2017.75 urn:nbn:de:0030-drops-74078 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.75 eng https://creativecommons.org/licenses/by/3.0/legalcode