Pages that link to "Item:Q4985488"
From MaRDI portal
The following pages link to An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488):
Displaying 4 items.
- Finding minimum dominating cycles in permutation graphs (Q1060966) (← links)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
- Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)
- Edge-vertex domination on interval graphs (Q6551198) (← links)