Pages that link to "Item:Q4634287"
From MaRDI portal
The following pages link to An optimal algorithm to find minimum k-hop dominating set of interval graphs (Q4634287):
Displaying 4 items.
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266) (← links)
- A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs (Q4985488) (← links)
- k-Efficient domination: Algorithmic perspective (Q6115759) (← links)
