A new derivation of Frisch's algorithm for calculating vertex-pair connectivity

DOI10.1007/BF01935329zbMath0261.68019OpenAlexW2047701926MaRDI QIDQ5677065

Kenneth Steiglitz, John L. Bruno

Publication date: 1971

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01935329

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

• An Algorithm for Vertex-pair Connectivity
• Unnamed Item

This page was built for publication: A new derivation of Frisch's algorithm for calculating vertex-pair connectivity