Pages that link to "Item:Q6102924"
From MaRDI portal
The following pages link to An iterated greedy algorithm for finding the minimum dominating set in graphs (Q6102924):
Displaying 5 items.
- Analysis of a greedy heuristic for finding small dominating sets in graphs (Q1183397) (← links)
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs (Q1566569) (← links)
- (Q3703920) (← links)
- Iterative algorithms for generating minimal cutsets in directed graphs (Q3783817) (← links)
- A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (Q5696912) (← links)