On computing the connectivities of graphs and digraphs
From MaRDI portal
Publication:3330525
DOI10.1002/net.3230140211zbMath0542.68051MaRDI QIDQ3330525
S. Louis Hakimi, Abdol-Hossein Esfahanian
Publication date: 1984
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230140211
Related Items
Graph theory (algorithmic, algebraic, and metric problems), Graph connectivity, partial words, and a theorem of Fine and Wilf, On computing a conditional edge-connectivity of a graph, A linear time algorithm for computing 3-edge-connected components in a multigraph, Extracting maximal information about sets of minimum cuts, An algorithm for finding all thek-components of a digraph