A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph

DOI10.1145/321921.321928zbMath0322.05145OpenAlexW2050858249MaRDI QIDQ4083485

Alberto Martelli

Publication date: 1976

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321921.321928

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph theory (05C99)

Related Items

Fast computation of bounds for two-terminal network reliability, Algebraic Methods Applied to Network Reliability Problems, Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay, Iterative algorithms for generating minimal cutsets in directed graphs, A simple algorithm to search for all MCs in networks