Graph orientations with set connectivity requirements
From MaRDI portal
Publication:442326
DOI10.1016/j.disc.2012.04.004zbMath1245.05074OpenAlexW1978956606MaRDI QIDQ442326
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.04.004
Related Items
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams, The strong network orientation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Augmenting edge-connectivity between vertex subsets
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
- An algorithm for source location in directed graphs
- On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- The Set Connector Problem in Graphs