A simplified O(nm) time edge-splitting algorithm in undirected graphs
From MaRDI portal
Publication:1969943
Recommendations
- scientific article; zbMATH DE number 1256720
- Deterministic O(nm) time edge-splitting in undirected graphs
- An edge-splitting algorithm in planar graphs
- An O(n2) Algorithm for Undirected Split Decomposition
- Efficient splitting off algorithms for graphs
- \(O(m\log n)\) split decomposition of strongly-connected graphs
- O(m n) split decomposition of strongly connected graphs
- Faster parameterized algorithms for deletion to split graphs
- Faster parameterized algorithms for deletion to split graphs
- A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
Cited in
(15)- Deterministic O(nm) time edge-splitting in undirected graphs
- A fast algorithm for cactus representations of minimum cuts
- Approximate edge splitting
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements
- scientific article; zbMATH DE number 1256720 (Why is no real title available?)
- Augmenting Undirected Edge Connectivity in Õ(n2) Time
- Fast edge orientation for unweighted graphs
- Edge Bipartization Faster Than 2ᵏ
- A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
- Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities
- Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities
- A new contraction technique with applications to congruency-constrained cuts
- Bipartition constrained edge-splitting in directed graphs
- Graph connectivity and its augmentation: Applications of MA orderings
- \(O(m\log n)\) split decomposition of strongly-connected graphs
This page was built for publication: A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969943)
