Pages that link to "Item:Q5090462"
From MaRDI portal
The following pages link to Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462):
Displaying 3 items.
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
