An algorithm for finding all thek-components of a digraph

DOI10.1080/00207168808803645zbMath0658.68075OpenAlexW2058454080MaRDI QIDQ3806837

Seishi Makino

Publication date: 1988

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168808803645

zbMATH Keywords

digraphconnectivitynetwork flowvertex separatork-component

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Related Items (4)

On computing the 2-vertex-connected components of directed graphs ⋮ Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time ⋮ Strong Connectivity in Directed Graphs under Failures, with Applications ⋮ Finding densest \(k\)-connected subgraphs

Cites Work

• Unnamed Item
• Multi-terminal maximum flows in node-capacitated networks
• k-Blocks and Ultrablocks in Graphs
• Bottlenecks and Edge Connectivity in Unsymmetrical Networks
• On computing the connectivities of graphs and digraphs
• Finding the Vertex Connectivity of Graphs
• Network Flow and Testing Graph Connectivity
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: An algorithm for finding all thek-components of a digraph