Enumeration of maximal irredundant sets for claw-free graphs
From MaRDI portal
Publication:1628586
DOI10.1016/j.tcs.2018.02.014zbMath1409.05109OpenAlexW2789726785MaRDI QIDQ1628586
Mohamed Yosri Sayadi, Petr A. Golovach, Dieter Kratsch
Publication date: 4 December 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.02.014
Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Locally definable vertex set properties are efficiently enumerable, Enumeration and maximum number of maximal irredundant sets for chordal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- A fast branching algorithm for cluster vertex deletion
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- On the number of minimal dominating sets on some graph classes
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Exact exponential algorithms.
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Enumerating minimal dominating sets in chordal graphs
- Enumerating minimal dominating sets in chordal bipartite graphs
- Claw-free graphs. V. Global structure
- On maximal independent sets of vertices in claw-free graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Contributions to the theory of domination, independence and irredundance in graphs
- Chordal graphs and upper irredundance, upper domination and independence
- Trees having many minimal dominating sets
- On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs
- Enumeration of Minimal Dominating Sets and Variants
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
- The Private Neighbor Cube
- On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets
- Combinatorial bounds via measure and conquer
- Exact Algorithms via Monotone Local Search
- On the Enumeration of Minimal Dominating Sets and Related Notions
- Enumeration of Maximal Irredundant Sets for Claw-Free Graphs
- Enumeration and maximum number of maximal irredundant sets for chordal graphs
