Enumerating \(k\)-arc-connected orientations
From MaRDI portal
Publication:2211357
DOI10.1007/s00453-020-00738-yzbMath1494.05057arXiv1908.02050OpenAlexW3047321816MaRDI QIDQ2211357
Petru Valicov, Kolja Knauer, Sarah Blind
Publication date: 11 November 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.02050
Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating all the acyclic orientations of an undirected graph
- Triangle contact representations and duality
- Strongly 2-connected orientations of graphs
- An algorithm for minimum cost arc-connectivity orientations
- The duality conjecture in formal knot theory
- A note on k-strongly connected orientations of an undirected graph
- Gray codes from antimatroids
- On the complexity of diagram testing
- A distributive lattice on the set of perfect matchings of a plane bipartite graph
- Efficient enumeration of graph orientations with sources
- Lattice structures from planar graphs
- The lattice structure of the set of domino tilings of a polygon
- A complexity theory for hard enumeration problems
- On Frank's conjecture on \(k\)-connected orientations
- Efficient splitting off algorithms for graphs
- Directing Road Networks by Listing Strong Orientations
- Rectangle and Square Representations of Planar Graphs
- Conway's Tiling Groups
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Generating the Acyclic Orientations of a Graph
- Completing orientations of partially oriented graphs
- An Algorithm for Submodular Functions on Graphs
- Circuit bases of strongly connected digraphs
- Centroids, Representations, and Submodular Flows
- Max flows in O(nm) time, or better
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities
- Pentagon contact representations
- Flip distances between graph orientations
- Algebraic graph theory. Morphisms, monoids and matrices
- Efficient algorithms on distributive lattices
This page was built for publication: Enumerating \(k\)-arc-connected orientations
