Enumerating minimal dominating sets in chordal bipartite graphs
From MaRDI portal
Recommendations
- A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs
- On the enumeration of minimal dominating sets and related notions
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Counting minimal dominating sets
Cites work
- A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions
- An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
- Computing a perfect edge without vertex elimination ordering of a chordal bipartite graph
- Dual subimplicants of positive Boolean functions
- Efficient read-restricted monotone CNF/DNF dualization by learning with membership queries
- Enumeration of the Elementary Circuits of a Directed Graph
- Exact transversal hypergraphs and application to Boolean \(\mu\)-functions
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Generating all vertices of a polyhedron is hard
- Generating cut conjunctions in graphs and related problems
- Graph Classes: A Survey
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1931696 (Why is no real title available?)
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- LATIN 2004: Theoretical Informatics
- Linear delay enumeration and monadic second-order logic
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- NP-completeness: a retrospective
- On enumerating all minimal solutions of feedback problems
- On enumerating minimal dicuts and strongly connected subgraphs
- On generating all maximal independent sets
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- On the enumeration and counting of minimal dominating sets in interval and permutation graphs
- On the enumeration of minimal dominating sets and related notions
- On the neighbourhood Helly of some graph classes and applications to the enumeration of minimal dominating sets
- Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs
- Perfect Elimination and Chordal Bipartite Graphs
- Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
- Reverse search for enumeration
- The Maximum Latency and Identification of Positive Boolean Functions
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
Cited in
(28)- Enumeration of maximal irredundant sets for claw-free graphs
- A min-max property of chordal bipartite graphs with applications
- Efficient enumeration of dominating sets for sparse graphs
- On the dualization in distributive lattices and related problems
- On the complexity of solution extension of optimization problems
- Linear algorithms for red and blue domination in convex bipartite graphs
- On strictly chordality-\(k\) graphs
- Invited talks
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs
- Enumeration of minimal dominating sets and variants
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Enumerating minimal dominating sets in \(K_t\)-free graphs and variants
- Enumerating minimal transversals of hypergraphs without small holes
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs
- Efficient enumeration of dominating sets for sparse graphs
- On the enumeration of minimal dominating sets and related notions
- Enumeration of maximal irredundant sets for claw-free graphs
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- scientific article; zbMATH DE number 7650296 (Why is no real title available?)
- Minimal Roman dominating functions: extensions and enumeration
- Minimal Roman dominating functions: extensions and enumeration
- Decomposing convex bipartite graphs into biconvex graphs and enumerating minimum weight red blue dominating sets
- Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
- Hypergraph dualization with \textsf{FPT}-delay parameterized by the degeneracy and dimension
- Enumerating minimal dominating sets and variants in chordal bipartite graphs
- Roman census: enumerating and counting Roman dominating functions on graph classes
- On geometric bipartite graphs with asymptotically smallest Zarankiewicz numbers
This page was built for publication: Enumerating minimal dominating sets in chordal bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896653)
