Tag Archives: Dominating Set

Protected: Min-Sum Multicenter

Posted on October 11, 2016 | Enter your password to view comments.

Enter your password to view comments.

Posted in Appendix- Network Design

Tagged Dominating Set, Min-Sum Muticenter, ND51, p-median

Protected: Min-Max Multicenter

Posted on October 4, 2016 | Enter your password to view comments.

Enter your password to view comments.

Posted in Appendix- Network Design

Tagged Difficulty 3, Dominating Set, Min-Max Multicenter, VC<=3, Vertex Cover

Protected: Dominating Set on Bipartite Graphs

Posted on November 17, 2015 | Enter your password to view comments.

Enter your password to view comments.

Posted in Problems not in appendix

Tagged Difficulty 3, Dominating Set, Dominating Set on Bipartite Graphs, No G&J reference, uncited reduction

Protected: Maximum Leaf Spanning Tree, Connected Dominating Set

Posted on October 13, 2015 | Enter your password to view comments.

Enter your password to view comments.

Posted in Appendix- Network Design

Tagged Difficulty 2, Difficulty 5, Dominating Set, Hamiltonian Path, ND2, No G&J reference, Not in Appendix, uncited reduction, Vertex Cover

Protected: Domatic Number

Posted on August 19, 2014 | Enter your password to view comments.

Enter your password to view comments.

Posted in Appendix-Graph Theory

Tagged 3-sat, Difficulty 7, Domatic Number, Dominating Set, Graph 3-coloring, GT3, reductions, Vertex Cover

Protected: Dominating Set

Posted on July 15, 2014 | Enter your password to view comments.

Enter your password to view comments.

Posted in Chapter 3 Exercises

Tagged Difficulty 4, Dominating Set, GT2, No G&J reference, reductions, uncited reduction, Vertex Cover