Pages that link to "Item:Q5069774"
From MaRDI portal
The following pages link to An efficient algorithm to solve the distance<i>k</i>-domination problem on permutation graphs (Q5069774):
Displaying 8 items.
- A new approach for the domination problem on permutation graphs (Q750166) (← links)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
- Mim-width. III. Graph powers and generalized distance domination problems (Q2333800) (← links)
- Distance Domination in Graphs (Q3384610) (← links)
- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs (Q3651563) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
- (Q5009468) (← links)
- Edge-vertex domination on interval graphs (Q6551198) (← links)