Discussions of NP-Complete Problems

A Resource for Computer Science Educators

Home
About the SIte
Bibliography
How to get the archive password

Category Archives: Appendix-Graph Theory

Protected: Multiple Choice Matching

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix-Graph Theory and tagged 3-sat, Difficulty 6, GT55, Multiple Choice Matching, Path With Forbidden Pairs, sat on July 28, 2015 by Sean T. McCulloch.

Protected: Path With Forbidden Pairs

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix-Graph Theory and tagged 3-sat, Difficulty 5, GT54, Path With Forbidden Pairs, uncited reduction on July 21, 2015 by Sean T. McCulloch.

Protected: Digraph D-Morphism

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix-Graph Theory and tagged Difficulty 8, GGN, Graph D-Morphism, GT53 on July 14, 2015 by Sean T. McCulloch.

Protected: Graph Homomorphism

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix-Graph Theory and tagged Difficulty 3, Difficulty 4, Graph 3-coloring, Graph Contraction, Graph Homomorphism, GT52, uncited reduction on July 7, 2015 by Sean T. McCulloch.

Protected: Graph Contractability

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix-Graph Theory, Uncategorized and tagged Difficulty 7, Difficulty 8, Graph Contractability, GT51, Set Splitting on June 30, 2015 by Sean T. McCulloch.

Protected: Maximum Subgraph Matching

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix-Graph Theory and tagged Clique, Difficulty 2, Difficulty 5, GT48, GT50, Largest Common Subgraph, Maximum Subgraph Matching, No G&J reference, Subgraph Isomorphism, uncited reduction on June 23, 2015 by Sean T. McCulloch.

Protected: Elimination Degree Sequence

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix-Graph Theory and tagged Difficulty 6, Elimination Degree Sequence, No G&J reference, uncited reduction, X3C on June 16, 2015 by Sean T. McCulloch.

Protected: Directed Elimination Ordering

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix-Graph Theory and tagged 3-sat, Difficulty 9, Directed Elimination Ordering, GT46 on June 9, 2015 by Sean T. McCulloch.

Protected: Rooted Tree Arrangement

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix-Graph Theory and tagged Difficulty 7, Optimal Linear Arrangement, Rooted Tree Arrangement on June 2, 2015 by Sean T. McCulloch.

Protected: Minimum Cut Linear Arrangement

Enter your password to view comments.

This content is password protected. To view it please enter your password below:

Password:

This entry was posted in Appendix-Graph Theory, Uncategorized and tagged Bipartite Subgraph, Difficulty 8, GT44, Minimum Cut Linear Arrangement on May 26, 2015 by Sean T. McCulloch.

← Older posts

Newer posts →

Search for: