Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs
From MaRDI portal
Publication:5219669
DOI10.1287/moor.2017.0883zbMath1434.05082arXiv1608.05729OpenAlexW2963166239MaRDI QIDQ5219669
Publication date: 12 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.05729
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (3)
Packing of maximal independent mixed arborescences ⋮ Packing branchings under cardinality constraints on their root sets ⋮ Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Studies on directed graphs. I, II
- A theorem on flows in networks
- An algorithm to increase the node-connectivity of a digraph by one
- Matching theory
- Matrices of 0's and 1's with total support
- Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- Minimal edge-coverings of pairs of sets
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography
- Characterization of Digraphic Sequences with Strongly Connected Realizations
- Combinatorial Properties of Matrices of Zeros and Ones
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Primal-dual approach for directed vertex connectivity augmentation and generalizations
- Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings
- Supermodularity in Unweighted Graph Optimization II: Matroidal Term Rank Augmentation
- Local Restrictions for Various Classes of Directed Graphs
- Combinatorial Matrix Theory
- On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
- Existence of k-edge connected ordinary graphs with prescribed degrees
This page was built for publication: Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs
