Efficient splitting off algorithms for graphs
From MaRDI portal
Publication:2817664
DOI10.1145/195058.195436zbMath1345.05099OpenAlexW2148922672MaRDI QIDQ2817664
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195436
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (16)
On Element-Connectivity Preserving Graph Simplification ⋮ A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem ⋮ On orientations maximizing total arc-connectivity ⋮ Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams ⋮ Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems ⋮ On 2-strong connectivity orientations of mixed graphs and related problems ⋮ Enumerating \(k\)-arc-connected orientations ⋮ Augmenting edge-connectivity between vertex subsets ⋮ Multigraph augmentation under biconnectivity and general edge-connectivity requirements ⋮ Recent results on well-balanced orientations ⋮ Well-balanced orientations of mixed graphs ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ Simultaneous well-balanced orientations of graphs ⋮ A new contraction technique with applications to congruency-constrained cuts ⋮ Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs ⋮ On the hardness of palletizing bins using FIFO queues
This page was built for publication: Efficient splitting off algorithms for graphs
