Generating cut conjunctions in graphs and related problems
From MaRDI portal
(Redirected from Publication:930604)
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of matroids and geometric lattices (05B35)
Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- A note on finding the bridges of a graph
- An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- Mathematical Foundations of Computer Science 2004
- Multi-Commodity Network Flows
- On enumerating all minimal solutions of feedback problems
- On generating all maximal independent sets
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the Complexity of Some Enumeration Problems for Matroids
- The Complexity of Multiterminal Cuts
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
Cited in
(14)- Polynomial-delay enumeration of large maximal common independent sets in two matroids and beyond
- Mathematical Foundations of Computer Science 2004
- scientific article; zbMATH DE number 1757966 (Why is no real title available?)
- Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
- Enumerating minimal dominating sets in chordal bipartite graphs
- Algorithms and Computation
- Reflections on generating (disjunctive) cuts
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
- scientific article; zbMATH DE number 7559431 (Why is no real title available?)
- Enumerating minimal transversals of hypergraphs without small holes
- Scientific contributions of Leo Khachiyan (a short overview)
- Polynomial-delay and polynomial-space enumeration of large maximal matchings
- Polynomial delay algorithm for listing minimal edge dominating sets in graphs
This page was built for publication: Generating cut conjunctions in graphs and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930604)
