Skip to content

Discussions of NP-Complete Problems

A Resource for Computer Science Educators

Home
About the SIte
Bibliography
How to get the archive password

Tag Archives: Dominating Set

Protected: Min-Sum Multicenter

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix- Network Design and tagged Dominating Set, Min-Sum Muticenter, ND51, p-median on October 11, 2016 by Sean T. McCulloch.

Protected: Min-Max Multicenter

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix- Network Design and tagged Difficulty 3, Dominating Set, Min-Max Multicenter, VC<=3, Vertex Cover on October 4, 2016 by Sean T. McCulloch.

Protected: Dominating Set on Bipartite Graphs

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Problems not in appendix and tagged Difficulty 3, Dominating Set, Dominating Set on Bipartite Graphs, No G&J reference, uncited reduction on November 17, 2015 by Sean T. McCulloch.

Protected: Maximum Leaf Spanning Tree, Connected Dominating Set

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix- Network Design and tagged Difficulty 2, Difficulty 5, Dominating Set, Hamiltonian Path, ND2, No G&J reference, Not in Appendix, uncited reduction, Vertex Cover on October 13, 2015 by Sean T. McCulloch.

Protected: Domatic Number

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Appendix-Graph Theory and tagged 3-sat, Difficulty 7, Domatic Number, Dominating Set, Graph 3-coloring, GT3, reductions, Vertex Cover on August 19, 2014 by Sean T. McCulloch.

Protected: Dominating Set

Enter your password to view comments.

This content is password-protected. To view it, please enter the password below.

Password:

This entry was posted in Chapter 3 Exercises and tagged Difficulty 4, Dominating Set, GT2, No G&J reference, reductions, uncited reduction, Vertex Cover on July 15, 2014 by Sean T. McCulloch.

Search for:

Recent Posts

And That’s It! August 21, 2025
Fault Detection With Test Points August 20, 2025
Fault Detection in Directed Graphs August 13, 2025
Fault Detection in Logic Circuits March 8, 2024
Minimum Weight And/Or Graph Solution February 15, 2024

Recent Comments

Sean T. McCulloch on And That’s It!
Greg Hamerly on And That’s It!
Sean T. McCulloch on Exact Cover by 3-Sets
nifets on Exact Cover by 3-Sets
Sean T. McCulloch on Fault Detection in Logic Circuits

Archives

Categories

Algebra and Number Theory
Appendix- Algebra and Number Theory
Appendix- Automata and Language Theory
Appendix- Games and Puzzles
Appendix- Mathematical Programming
Appendix- Network Design
Appendix- Program Optimization
Appendix- Sets and Partitions
Appendix-Graph Theory
Appendix-Logic
Appendix: Miscellaneous
Appendix: Sequencing and Scheduling
Appendix: Storage and Retrieval
Chapter 3 Exercises
Core Problems
Overview
Problems not in appendix
Uncategorized

Proudly powered by WordPress