Pages that link to "Item:Q781288"
From MaRDI portal
The following pages link to An order-based algorithm for minimum dominating set with application in graph mining (Q781288):
Displaying 9 items.
- An integer programming approach for solving a generalized version of the Grundy domination number (Q2032968) (← links)
- A heuristic approximation algorithm of minimum dominating set based on rough set theory (Q2168768) (← links)
- An evolutionary algorithm based hyper-heuristic framework for the set packing problem (Q2656742) (← links)
- Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism (Q2680785) (← links)
- The Evolution of the Minimum Degree Ordering Algorithm (Q3823722) (← links)
- An iterated greedy algorithm for finding the minimum dominating set in graphs (Q6102924) (← links)
- An efficient local search algorithm for minimum positive influence dominating set problem (Q6109569) (← links)
- Solving the minimum-cost double Roman domination problem (Q6608515) (← links)
- Integer linear programming models and greedy heuristic for the minimum weighted independent dominating set problem (Q6638677) (← links)