Splitting-off in hypergraphs
From MaRDI portal
Cites work
- A graph reduction step preserving element-connectivity and packing Steiner trees and forests
- A new contraction technique with applications to congruency-constrained cuts
- A Reduction Method for Edge-Connectivity in Graphs
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
- A unifying approach to splitting-off
- Algorithmic Aspects of Graph Connectivity
- An approximate max-Steiner-tree-packing min-Steiner-cut theorem
- An improved approximation guarantee for prize-collecting TSP
- Approximate edge splitting
- Approximate integer decompositions for undirected network design problems
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
- Augmenting edge connectivity via isolating cuts
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmenting hypergraphs by edges of size two
- Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification
- Computing All Small Cuts in an Undirected Network
- Connections in combinatorial optimization
- Covering skew-supermodular functions by hypergraphs of minimum total size
- Degree bounded network design with metric costs
- Edge connectivity augmentation in near-linear time
- Edge-Disjoint Spanning Trees of Finite Graphs
- Edge-disjoint trees containing some given vertices in a graph
- Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities
- Efficient splitting off algorithms for graphs
- Graph orientations with edge-connection and parity constraints
- High-Quality Hypergraph Partitioning
- scientific article; zbMATH DE number 446490 (Why is no real title available?)
- scientific article; zbMATH DE number 5764893 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 2079349 (Why is no real title available?)
- Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time
- Hypergraph \(k\)-cut in randomized polynomial time
- Hypergraph Cuts with General Splitting Functions
- Improved list-decodability and list-recoverability of Reed-Solomon codes via tree packings (extended abstract)
- Min-max partitioning of hypergraphs and symmetric submodular functions
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- Minimum cuts and sparsification in hypergraphs
- Near-linear size hypergraph cut sparsifiers
- New notions and constructions of sparsification for graphs and hypergraphs
- On minimally \(k\)-edge-connected graphs and shortest \(k\)-edge-connected Steiner networks
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
- On some connectivity properties of Eulerian graphs
- On the number of small cut in a graph
- On the Problem of Decomposing a Graph into n Connected Factors
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
- Random contractions and sampling for hypergraph and hedge connectivity
- Sketching cuts in graphs and hypergraphs
- Spectral hypergraph sparsification via chaining
- Spectral hypergraph sparsifiers of nearly linear size
- Spectral sparsification of hypergraphs
- Steiner connectivity augmentation and splitting-off in poly-logarithmic maximum flows
- Survivable networks, linear programming relaxations and the parsimonious property
- Towards tight bounds for spectral sparsification of hypergraphs
This page was built for publication: Splitting-off in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862414)
