Enumerating minimal dominating sets in chordal graphs
DOI10.1016/J.IPL.2016.07.002zbMATH Open1371.05127OpenAlexW2487741757MaRDI QIDQ738877FDOQ738877
Authors: Faisal N. Abu-Khzam, Pinar Heggernes 
Publication date: 16 August 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2016.07.002
Recommendations
- Enumeration and maximum number of minimal dominating sets for chordal graphs
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Enumeration of minimal connected dominating sets for chordal graphs
- Enumerating minimal connected dominating sets in graphs of bounded chordality
graph algorithmschordal graphsbranching algorithminput sensitive enumerationmaximum number of minimal dominating sets
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30)
Cites Work
- Graph Classes: A Survey
- Exact exponential algorithms.
- Algorithmic graph theory and perfect graphs
- On rigid circuit graphs
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- On the number of minimal dominating sets on some graph classes
- On the enumeration of minimal dominating sets and related notions
Cited In (18)
- Title not available (Why is that?)
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
- Title not available (Why is that?)
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Minimal Roman dominating functions: extensions and enumeration
- Enumeration of maximal irredundant sets for claw-free graphs
- Enumeration of maximal irredundant sets for claw-free graphs
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
- Bounds for the connected domination number of maximal outerplanar graphs
- Enumeration of minimal connected dominating sets for chordal graphs
- Acyclic edge coloring of chordal graphs with bounded degree
- Enumeration and maximum number of minimal dominating sets for chordal graphs
- An improved exact algorithm for minimum dominating set in chordal graphs
- Linear-time generation of random chordal graphs
- Minimal Roman dominating functions: extensions and enumeration
- Title not available (Why is that?)
This page was built for publication: Enumerating minimal dominating sets in chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q738877)
