Edge-orders
From MaRDI portal
Publication:1741850
DOI10.1007/s00453-018-0516-4zbMath1423.68356arXiv1607.04431OpenAlexW3037154530MaRDI QIDQ1741850
Publication date: 7 May 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.04431
linear timecanonical ordering3-edge-connected graphsedge-independent spanning treeedge-orderMondshein sequencenon-separating ear decompositionst-edge-order
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for four-partitioning four-connected planar graphs
- Certifying algorithms
- Certifying 3-edge-connectivity
- A linear-time algorithm for a special case of disjoint set union
- The multi-tree approach to reliability in distributed networks
- Computing an st-numbering
- A simple test on 2-vertex- and 2-edge-connectivity
- A counterexample for the proof of implication conjecture on independent spanning trees
- Mondshein Sequences (a.k.a. (2,1)-Orders)
- Small-Area Orthogonal Drawings of 3-Connected Graphs
- Construction Sequences and Certifying 3-Connectedness
- Four Edge-Independent Spanning Trees
- More Canonical Ordering
- A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
- Dynamic orthogonal segment intersection search
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- A Reduction Method for Edge-Connectivity in Graphs
- The Mondshein Sequence
- Chain Decompositions of 4-Connected Graphs
- The (3,1)-ordering for 4-connected planar triangulations
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
This page was built for publication: Edge-orders
