Pages that link to "Item:Q2872098"
From MaRDI portal
The following pages link to On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs (Q2872098):
Displaying 13 items.
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- On the number of minimal dominating sets on some graph classes (Q476916) (← links)
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
- Locally definable vertex set properties are efficiently enumerable (Q1983133) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808) (← links)
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs (Q3449842) (← links)
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
- Enumeration of Maximal Irredundant Sets for Claw-Free Graphs (Q5283376) (← links)
