Pages that link to "Item:Q3449842"

The following pages link to Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs (Q3449842):

Displayed 15 items.

• Minimal dominating sets in interval graphs and trees (Q344851) ‎ (← 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)
• Efficient enumeration of dominating sets for sparse graphs (Q1983139) ‎ (← links)
• On the complexity of solution extension of optimization problems (Q2072063) ‎ (← links)
• Extension and its price for the connected vertex cover problem (Q2072064) ‎ (← links)
• Enumeration and maximum number of minimal dominating sets for chordal graphs (Q2317861) ‎ (← links)
• Invited talks (Q2692717) ‎ (← links)
• Upper Domination: Complexity and Approximation (Q2819508) ‎ (← links)
• A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808) ‎ (← links)
• Counting Minimal Dominating Sets (Q2988832) ‎ (← links)
• (Q5090486) ‎ (← links)
• (Q5090998) ‎ (← links)
• Enumeration of Maximal Irredundant Sets for Claw-Free Graphs (Q5283376) ‎ (← links)
• Minimal Roman dominating functions: extensions and enumeration (Q6043174) ‎ (← links)