An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
From MaRDI portal
Publication:3902508
DOI10.1145/322217.322220zbMATH Open0454.68066OpenAlexW2167046094MaRDI QIDQ3902508FDOQ3902508
Authors: Shuji Tsukiyama, Isao Shirakawa, Hiroshi Ozaki, Hiromu Ariyoshi 
Publication date: 1980
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322217.322220
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)
Cited In (16)
- Title not available (Why is that?)
- An enumeration algorithm for combinatorial problems of the reliability analysis of binary coherent systems
- Iterative algorithms for generating minimal cutsets in directed graphs
- Fast computation of bounds for two-terminal network reliability
- Enumerating minimal dominating sets in chordal bipartite graphs
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- Heuristic testing procedures for general coherent systems
- Efficient enumeration of all minimal separators in a graph
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- Assembly planning by disjunctive programming and geometrical reasoning
- Generating cut conjunctions in graphs and related problems
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Title not available (Why is that?)
- Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay
- Heuristic least-cost computation of discrete classification functions with uncertain argument values
Uses Software
This page was built for publication: An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902508)
