| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 418634 | Discrete Applied Mathematics | 2010 | 21 Pages |
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(n3)O(n3). We give an O(mlogn)O(mlogn) bound.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Benson L. Joeris, Scott Lundberg, Ross M. McConnell,