On computing the connectivities of graphs and digraphs

DOI10.1002/NET.3230140211MaRDI QIDQ3330525zbMATH OpenOpenAlexFDO

Authors 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

algorithmsdigraphedge-connectivitygraphvertex-connectivity

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4025476
• The connectivity of large digraphs and graphs
• On the distance connectivity of graphs and digraphs
• The complexity of graph connectivity
• Edge-connectivities of graphs and digraphs
• Connectivity and extendability in digraphs
• Connected graphs and their connectivities
• On the spanning connectivity of graphs
• Algorithmic Aspects of Graph Connectivity
• scientific article; zbMATH DE number 18406

Cited in

(22)

• 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
• Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity
• Reliability analysis of the generalized balanced hypercube
• Efficient algorithm for computing all low s-t edge connectivities in directed graphs
• Using expander graphs to find vertex connectivity
• scientific article; zbMATH DE number 3989401 (Why is no real title available?)
• scientific article; zbMATH DE number 4025476 (Why is no real title available?)
• An algorithm for finding all thek-components of a digraph
• Finding the edge connectivity of directed graphs
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• scientific article; zbMATH DE number 1161250 (Why is no real title available?)
• Connectivity algorithms
• GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization)
• A linear algorithm of checking of the graph connectness
• Performance analysis and comparison of algorithms for measures of network connectivity
• Computing Vertex Connectivity: New Bounds from Old Techniques
• A polynomial time algorithm for cyclic vertex connectivity of cubic graphs
• Graph theory (algorithmic, algebraic, and metric problems)
• Finding most-shattering minimum vertex cuts of polylogarithmic size in near-linear time
• Graph connectivity, partial words, and a theorem of Fine and Wilf

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3330525)