scientific article; zbMATH DE number 1234600
From MaRDI portal
Publication:4221374
Recommendations
- Iterative algorithms for generating minimal cutsets in directed graphs
- Simple enumeration of minimal cutsets of acyclic directed graph
- Generating cut conjunctions in graphs and related problems
- A parallel algorithm for finding minimum cutsets in reducible graphs
- A simple algorithm to search for all minimal cutsets with unreliable nodes
Cited in
(18)- A parallel algorithm for finding minimum cutsets in reducible graphs
- Solving a combinatorial problem with network flows
- I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
- Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
- Finding all minimum-size separating vertex sets in a graph
- Algorithms for Generating Minimal Cutsets by Inversion
- A Method for Evaluating All the Minimal Cuts of a Graph
- Iterative algorithms for generating minimal cutsets in directed graphs
- Simple enumeration of minimal cutsets of acyclic directed graph
- scientific article; zbMATH DE number 4091549 (Why is no real title available?)
- An \NC Algorithm for Minimum Cuts
- Computing All Small Cuts in an Undirected Network
- scientific article; zbMATH DE number 1783770 (Why is no real title available?)
- scientific article; zbMATH DE number 3999696 (Why is no real title available?)
- Counting and sampling minimum cuts in genus g graphs
- Finding and using directed cuts of real graphs of algorithms
- Algorithms for the determination of cutsets in a hypergraph
- Generating cut conjunctions in graphs and related problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221374)
