Pages that link to "Item:Q1183397"
From MaRDI portal
The following pages link to Analysis of a greedy heuristic for finding small dominating sets in graphs (Q1183397):
Displayed 11 items.
- On the distribution of the domination number for random class cover catch digraphs (Q158221) (← links)
- An order-based algorithm for minimum dominating set with application in graph mining (Q781288) (← links)
- Classification using proximity catch digraphs (Q782440) (← links)
- The greedy algorithm for domination in graphs of maximum degree 3 (Q1029047) (← links)
- Characterizing the scale dimension of a high-dimensional classification problem (Q1856632) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- A heuristic approximation algorithm of minimum dominating set based on rough set theory (Q2168768) (← links)
- On parallelizing a greedy heuristic for finding small dominant sets (Q2366651) (← links)
- Heuristics for \(k\)-domination models of facility location problems in street networks (Q2668796) (← links)
- Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis (Q2988810) (← links)
- Data Exploration by Representative Region Selection: Axioms and Convergence (Q4958552) (← links)