Abstract
A k-component of a digraph is a maximal subgraph in which k disjoint paths exist between every ordered pair of vertices. A digraph may have many k-components, namely 1-components, 2-components,..., and so on. This paper presents an algorithm to find all the possible k-components of a digraph with n vertices and e edges within 0(n ∗ max (n+ e,T)time for every k, where T denotes the time bound to find a minimum vertex separator of the digraph. This result is also available for a graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
