On computing the connectivities of graphs and digraphs

DOI10.1002/net.3230140211zbMath0542.68051OpenAlexW2035315311MaRDI QIDQ3330525

Abdol-Hossein Esfahanian, S. Louis Hakimi

Publication date: 1984

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230140211

zbMATH Keywords

algorithmsgraphdigraphedge-connectivityvertex-connectivity

Mathematics Subject Classification ID

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

Related Items (8)

On computing a conditional edge-connectivity of a graph ⋮ Graph connectivity, partial words, and a theorem of Fine and Wilf ⋮ An algorithm for finding all thek-components of a digraph ⋮ A linear time algorithm for computing 3-edge-connected components in a multigraph ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Extracting maximal information about sets of minimum cuts ⋮ A polynomial time algorithm for cyclic vertex connectivity of cubic graphs ⋮ Reliability analysis of the generalized balanced hypercube

This page was built for publication: On computing the connectivities of graphs and digraphs