Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
From MaRDI portal
Publication:4837644
DOI10.1137/S0036142993226983zbMath0835.05039MaRDI QIDQ4837644
András Frank, Bill Jackson, Jörgen Bang-Jensen
Publication date: 8 April 1996
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
digraphsmixed graphssplitting theoremsedge-disjoint paths problemlocal edge- connectivitymin-max formulae
Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (20)
A constant-factor approximation for directed latency in quasi-polynomial time ⋮ Increasing digraph arc-connectivity by arc addition, reversal and complement ⋮ Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems ⋮ On packing time-respecting arborescences ⋮ The Generalized Terminal Backup Problem ⋮ A New Approach to Splitting-Off ⋮ Directed Steiner tree packing and directed tree connectivity ⋮ Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph ⋮ Edge-Connectivity Augmentations of Graphs and Hypergraphs ⋮ Splitting off edges between two subsets preserving the edge-connectivity of the graph. ⋮ A unifying approach to splitting-off ⋮ On packing arborescences in temporal networks ⋮ A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time ⋮ A parameterized algorithmics framework for degree sequence completion problems in directed graphs ⋮ Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems ⋮ Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ The \((2, k)\)-connectivity augmentation problem: algorithmic aspects ⋮ Covering skew-supermodular functions by hypergraphs of minimum total size ⋮ Unnamed Item
This page was built for publication: Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
