Pages that link to "Item:Q3088292"

The following pages link to Enumeration of Minimal Dominating Sets and Variants (Q3088292):

Displaying 12 items.

• The \(k\)-hop connected dominating set problem: hardness and polyhedra (Q324721) (← links)
• Minimal dominating sets in interval graphs and trees (Q344851) (← links)
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← 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)
• Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
• The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
• Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
• Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
• Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (Q2891369) (← links)
• Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
• (Q5090998) (← links)