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: Directed Optimal 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 and tagged Difficulty 8, Directed Optimal Linear Arrangement, GT43, Optimal Linear Arrangement on May 19, 2015 by Sean T. McCulloch.

Protected: Directed Bandwidth

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 3-Partition, Bandwidth, Difficulty 10, Directed Bandwidth on May 12, 2015 by Sean T. McCulloch.

Protected: Bandwidth

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 Bandwidth, Difficulty 8, Difficulty 9, GT40, Restricted LAP on April 21, 2015 by Sean T. McCulloch.

Protected: The Linear Array Problem

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 2, Difficulty 7, Directed Hamiltonian Circuit, GT37, GT38, GT39, GT40, Linear Array on April 7, 2015 by Sean T. McCulloch.

Protected: Path Graph Completion

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 4, Difficulty 8, GT36, Interval Graph Completion, Path Graph Completion, restrictions, uncited reduction on April 1, 2015 by Sean T. McCulloch.

Protected: Interval Graph Completion

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 9, GT35, Interval Graph Completion, Optimal Linear Arrangement on March 24, 2015 by Sean T. McCulloch.

Protected: Optimal 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 and tagged Bipartite Subgraph, Difficulty 8, GT42, Optimal Linear Arrangement, Simple Max-Cut on March 17, 2015 by Sean T. McCulloch.

Protected: Hamiltonian Completion

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 1, Difficulty 2, GT33, Gt34, Hamiltonian Circuit, Hamiltonian Completion, Hamiltonian Path, No G&J reference, uncited reduction on March 10, 2015 by Sean T. McCulloch.

Protected: Cubic Subgraph

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 Cubic Subgraph, Difficulty 9, GT32, One-In-Three 3SAT on March 3, 2015 by Sean T. McCulloch.

Protected: Minimum K-Connected Subgraph

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 4, Difficulty 6, GT31, Hamiltonian Circuit, Minimum K-Connected Subgraph, uncited reduction on February 17, 2015 by Sean T. McCulloch.

← Older posts

Newer posts →

Search for: