O(m n) split decomposition of strongly-connected graphs
From MaRDI portal
(Redirected from O(m n) split decomposition of strongly-connected graphs)
\(O(m\log n)\) split decomposition of strongly-connected graphs
\(O(m\log n)\) split decomposition of strongly-connected graphs
Recommendations
- O(m n) split decomposition of strongly connected graphs
- An O(n2) Algorithm for Undirected Split Decomposition
- scientific article; zbMATH DE number 1256720
- Deterministic O(nm) time edge-splitting in undirected graphs
- Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
- The toughness of split graphs
- Fully decomposable split graphs
- Fully decomposable split graphs
- A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
- On the complexity of partitioning graphs into connected subgraphs
Cites work
- An O(n2) Algorithm for Undirected Split Decomposition
- Completely separable graphs
- Compositions for perfect graphs
- Decomposition of Directed Graphs
- Digraph Decompositions and Eulerian Systems
- Distance-hereditary graphs
- scientific article; zbMATH DE number 3825206 (Why is no real title available?)
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- On Comparability and Permutation Graphs
- On the extension of bipartite to parity graphs
- Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
- PC trees and circular-ones arrangements.
- Prime Testing for the Split Decomposition of a Graph
- Recognizing circle graphs in polynomial time
- Reducing prime graphs and recognizing circle graphs
Cited in
(3)
This page was built for publication: \(O(m\log n)\) split decomposition of strongly-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972339)
