O(m logn) Split Decomposition of Strongly Connected Graphs

Authors:
Benson L. Joeris;Scott Lundberg;Ross M. Mcconnell
Affiliations:
Trinity College, Cambridge, UK CB2 1TQ;Computer Science Department, Colorado State University, Fort Collins, 80523-1873;Computer Science Department, Colorado State University, Fort Collins, 80523-1873
Venue:
Graph Theory, Computational Intelligence and Thought
Year:
2009

Citing 9
Cited 0

Digraph decompositions and Eulerian systems

SIAM Journal on Algebraic and Discrete Methods
Recognizing circle graphs in polynomial time

Journal of the ACM (JACM)
Prime testing for the split decomposition of a graph

SIAM Journal on Discrete Mathematics
An O(n2) algorithm for undirected split decomposition

Journal of Algorithms
Parallel algorithms for hierarchical clustering and applications to split decomposition and parity graph recognition

Journal of Algorithms
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Recognition and Isomorphism of Two Dimensional Partial Orders

Proceedings of the 10th Colloquium on Automata, Languages and Programming
Two-dimensional partial orders

Two-dimensional partial orders
Solving some NP-complete problems using split decomposition

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the early 1980's, Cunningham described a unique decomposition of a strongly-connected graph. A linear time bound for finding it in the special case of an undirected graph has been given previously, but up until now, the best bound known for the general case has been O (n 3). We give an O (m logn ) bound.