O(mlogn) split decomposition of strongly-connected graphs

Authors:
Benson L. Joeris;Scott Lundberg;Ross M. McConnell
Affiliations:
Colorado State University, United States;Colorado State University, United States;Colorado State University, United States
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 12
Cited 0

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
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
Reducing prime graphs and recognizing circle graphs

Combinatorica
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
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
Recognition and Isomorphism of Two Dimensional Partial Orders

Proceedings of the 10th Colloquium on Automata, Languages and Programming
PC trees and circular-ones arrangements

Theoretical Computer Science - Computing and combinatorics
Two-dimensional partial orders

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

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

In the early 1980s, 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(mlogn) bound.