Enumerating Minimal Dominating Sets in Triangle-Free Graphs
From MaRDI portal
Recommendations
- Enumerating minimal dominating sets in \(K_t\)-free graphs and variants
- Enumerating minimal dominating sets in chordal bipartite graphs
- Counting minimal dominating sets
- On the enumeration of minimal dominating sets and related notions
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
Cites work
- A polynomial delay algorithm for enumerating minimal dominating sets in chordal graphs
- An efficient search algorithm to find the elementary circuits of a graph
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Analysis and enumeration. Algorithms for biological graphs
- Computational aspects of monotone dualization: a brief survey
- Enumerating maximal independent sets with applications to graph colouring.
- Enumerating minimal dominating sets in chordal bipartite graphs
- Enumeration of minimal dominating sets and variants
- Enumeration of the Elementary Circuits of a Directed Graph
- Enumeration of the monomials of a polynomial and related complexity classes
- scientific article; zbMATH DE number 1931696 (Why is no real title available?)
- Linear delay enumeration and monadic second-order logic
- New Results on Monotone Dualization and Generating Hypergraph Transversals
- 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
- Parameterized and Exact Computation
- The Enumeration of Maximal Cliques of Large Graphs
- The Number of Maximal Independent Sets in Triangle-Free Graphs
Cited in
(7)- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
- Geometric dominating sets -- a minimum version of the no-three-in-line problem
- Minimal Roman dominating functions: extensions and enumeration
- Extension of some edge graph problems: standard, parameterized and approximation complexity
- Minimal Roman dominating functions: extensions and enumeration
- 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
This page was built for publication: Enumerating Minimal Dominating Sets in Triangle-Free Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090462)
