Pages that link to "Item:Q2166266"
From MaRDI portal
The following pages link to A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266):
Displaying 6 items.
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482) (← links)
- A linear algorithm for finding a minimum dominating set in a cactus (Q1078205) (← links)
- A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs (Q2079283) (← links)
- (Q4234099) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- Guarding polyominoes under \(k\)-hop visibility (Q6547940) (← links)