Pages that link to "Item:Q2456374"

The following pages link to An exact algorithm for the minimum dominating clique problem (Q2456374):

Displaying 7 items.

• Exact algorithms for dominating set (Q411862) (← links)
• Threshold dominating cliques in random graphs and interval routing (Q1044044) (← links)
• Algorithms for dominating clique problems (Q1758169) (← links)
• The complexity of connected dominating sets and total dominating sets with specified induced subgraphs (Q1941700) (← links)
• New results on connected dominating structures in graphs (Q2283728) (← links)
• On connected dominating sets of restricted diameter (Q2356248) (← links)
• Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (Q3502697) (← links)