Pages that link to "Item:Q4877526"

The following pages link to An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph (Q4877526):

Displayed 10 items.

• Total domination and transformation (Q287166) ‎ (← links)
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) ‎ (← links)
• Graph classes with structured neighborhoods and algorithmic applications (Q392023) ‎ (← links)
• Incorporating negative-weight vertices in certain vertex-search graph algorithms (Q1198080) ‎ (← links)
• On the feedback vertex set problem in permutation graphs (Q1338778) ‎ (← links)
• Dominations in trapezoid graphs (Q1342259) ‎ (← links)
• An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) ‎ (← links)
• Domination and total domination on asteroidal triple-free graphs (Q1962038) ‎ (← links)
• Graph Classes with Structured Neighborhoods and Algorithmic Applications (Q3104764) ‎ (← links)
• An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774) ‎ (← links)