Title of article
image split decomposition of strongly-connected graphs Original Research Article
Author/Authors
Benson L. Joeris، نويسنده , , Scott Lundberg، نويسنده , , Ross M. McConnell، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
21
From page
779
To page
799
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 image. We give an image bound.
Keywords
Graph decomposition , Join decomposition , Split decomposition
Journal title
Discrete Applied Mathematics
Serial Year
2010
Journal title
Discrete Applied Mathematics
Record number
887395
Link To Document