An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
From MaRDI portal
Publication:3902508
Cited in
(16)- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
- Generating cut conjunctions in graphs and related problems
- Efficient enumeration of all minimal separators in a graph
- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- Heuristic testing procedures for general coherent systems
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- Assembly planning by disjunctive programming and geometrical reasoning
- An enumeration algorithm for combinatorial problems of the reliability analysis of binary coherent systems
- scientific article; zbMATH DE number 7559431 (Why is no real title available?)
- Heuristic least-cost computation of discrete classification functions with uncertain argument values
- Enumerating minimal dominating sets in chordal bipartite graphs
- scientific article; zbMATH DE number 7559396 (Why is no real title available?)
- Iterative algorithms for generating minimal cutsets in directed graphs
- Fast computation of bounds for two-terminal network reliability
- Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay
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)
