Pages that link to "Item:Q1117255"

The following pages link to Finding a minimum independent dominating set in a permutation graph (Q1117255):

Displaying 16 items.

• On-line algorithms for the dominating set problem (Q290186) (← links)
• A new approach for the domination problem on permutation graphs (Q750166) (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
• A tight bound on the number of mobile servers to guarantee transferability among dominating configurations (Q972325) (← links)
• Finding minimum dominating cycles in permutation graphs (Q1060966) (← links)
• An efficient algorithm for maxdominance, with applications (Q1115629) (← links)
• The weighted maximum independent set problem in permutation graphs (Q1195927) (← links)
• The complexity of domination problems in circle graphs (Q1209148) (← links)
• A theorem on permutation graphs with applications (Q1328502) (← links)
• On the feedback vertex set problem in permutation graphs (Q1338778) (← links)
• An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
• Coloring permutation graphs in parallel (Q1613373) (← links)
• Fast algorithms for the dominating set problem on permutation graphs (Q2366239) (← links)
• Generate all maximal independent sets in permutation graphs (Q4323409) (← links)
• An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774) (← links)
• A resource assignment problem on graphs (Q6487990) (← links)