Pages that link to "Item:Q894482"
From MaRDI portal
The following pages link to A linear time algorithm for optimal \(k\)-hop dominating set of a tree (Q894482):
Displaying 8 items.
- A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree (Q1679914) (← links)
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266) (← links)
- Algorithm and hardness results on hop domination in graphs (Q2338219) (← links)
- Relationship between optimal \(k\)-distance dominating sets in a weighted graph and its spanning trees (Q2414036) (← links)
- An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
- (Q5018959) (← links)
- COMPUTATIONAL METHODS FOR LOGISTICS PROBLEMS RELATED TO OPTIMAL TREES (Q5370788) (← links)
