On the enumeration and counting of minimal dominating sets in interval and permutation graphs
DOI10.1007/978-3-642-45030-3_32zbMATH Open1407.05222OpenAlexW208146514MaRDI QIDQ2872098FDOQ2872098
Authors: Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno 
Publication date: 14 January 2014
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_32
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30)
Cited In (15)
- Locally definable vertex set properties are efficiently enumerable
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs
- On the number of minimal dominating sets on some graph classes
- Enumeration of maximal irredundant sets for claw-free graphs
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
- Enumerating minimal dominating sets in chordal bipartite graphs
- Minimal dominating sets in interval graphs and trees
- Finding minimum dominating cycles in permutation graphs
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Enumeration of minimal dominating sets and variants
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
- Distributed interactive proofs for the recognition of some geometric intersection graph classes
- Enumeration of Maximal Irredundant Sets for Claw-Free Graphs
This page was built for publication: On the enumeration and counting of minimal dominating sets in interval and permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872098)
