An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk
From MaRDI portal
Publication:4068762
DOI10.1137/0204034zbMath0311.05133MaRDI QIDQ4068762
Publication date: 1975
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6027
90B10: Deterministic network models in operations research
05C99: Graph theory
05C20: Directed graphs (digraphs), tournaments
68W99: Algorithms in computer science
Related Items
Improved algorithms for graph four-connectivity, Approximation algorithms for treewidth, Graph connectivity, partial words, and a theorem of Fine and Wilf, Acyclic k-connected subgraphs for distributed alternate routing in communications networks, Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity, Partition-based logical reasoning for first-order and propositional theories, Linear time algorithms for graph search and connectivity determination on complement graphs., Finding triconnected components of graphs, A simple variant of node connectivity is NP-complete
Uses Software