-
Recent Posts
- Fault Detection in Logic Circuits March 8, 2024
- Minimum Weight And/Or Graph Solution February 15, 2024
- Decision Tree February 2, 2024
- Simply Deviated Disjunction January 19, 2024
- Matrix Cover January 8, 2024
Recent Comments
Archives
- March 2024
- February 2024
- January 2024
- December 2023
- October 2023
- September 2023
- August 2023
- March 2023
- January 2023
- December 2022
- November 2022
- October 2022
- September 2022
- August 2022
- June 2022
- May 2022
- December 2021
- November 2021
- October 2021
- September 2021
- August 2021
- July 2021
- May 2021
- April 2021
- March 2021
- February 2021
- January 2021
- December 2020
- November 2020
- October 2020
- September 2020
- August 2020
- March 2020
- February 2020
- January 2020
- December 2019
- November 2019
- October 2019
- September 2019
- August 2019
- July 2019
- June 2019
- May 2019
- April 2019
- March 2019
- February 2019
- January 2019
- December 2018
- November 2018
- October 2018
- September 2018
- August 2018
- July 2018
- June 2018
- May 2018
- April 2018
- March 2018
- February 2018
- January 2018
- December 2017
- November 2017
- October 2017
- September 2017
- August 2017
- July 2017
- June 2017
- May 2017
- April 2017
- March 2017
- February 2017
- January 2017
- December 2016
- November 2016
- October 2016
- September 2016
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- November 2015
- October 2015
- September 2015
- August 2015
- July 2015
- June 2015
- May 2015
- April 2015
- March 2015
- February 2015
- January 2015
- December 2014
- November 2014
- October 2014
- September 2014
- August 2014
- July 2014
- June 2014
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
Tag Archives: Difficulty 9
Protected: Cubic Subgraph
Enter your password to view comments.
Posted in Appendix-Graph Theory, Uncategorized
Tagged Cubic Subgraph, Difficulty 9, GT32, One-In-Three 3SAT
Protected: Bipartite Subgraph on Cubic Graphs with no triangles
Enter your password to view comments.
Posted in Problems not in appendix
Tagged Bipartite Subgraph, Bipartite Subgraph on Cubic Graphs with no triangles, Difficulty 9, NAE3SAT
Protected: Edge-Subgraph
Enter your password to view comments.
Posted in Appendix-Graph Theory, Uncategorized
Tagged 3-sat, Difficulty 9, Edge Subgraph, GT28
Protected: Bipartite Subgraph
Enter your password to view comments.
Posted in Appendix-Graph Theory, Uncategorized
Tagged Bipartite Graph, Difficulty 2, Difficulty 9, GT25, Max 2-Sat, Simple Max-Cut
Protected: Parttion Into Perfect Matchings
Enter your password to view comments.
Posted in Appendix-Graph Theory
Tagged 3DM, Difficulty 4, Difficulty 9, GT16, NAE3SAT, uncited reduction
Protected: Partial Feedback Edge Set
Enter your password to view comments.
Posted in Appendix-Graph Theory, Uncategorized
Tagged Difficulty 9, Feedback Arc Set, GT9, Partial Feedback Edge Set, Vertex Cover
Protected: Vertex Cover on Graphs of Degree <=3
Enter your password to view comments.
Posted in Appendix-Graph Theory, Problems not in appendix
Tagged 3-sat, Difficulty 9, reductions, VC<=3, Vertex Cover
Protected: Regular Expression Inequivalence
Enter your password to view comments.
Posted in Chapter 3 Exercises
Tagged 3-sat, AL9, Difficulty 9, reductions, Regular Expression Inequivalence, Star-Free Regular Expression Inequivalence
Hamiltonian Circuit
This is one of my favorite problems, but one of the worst reductions to understand. I usually skip over it when I teach it, showing them the picture of the widget and saying “See? It’s Nuts!” and moving on
The problem: Hamiltonian Circuit (HC)
The definition: Given a graph G=(V,E), where |V| = N. Can I create an ordering <v1, v2…vn>of the vertices where an edge exists between each (vi, vi+1) in the sequence, and the edge (vn, v1) also exists?
(In other words, does a sequence of edges exist that lets me start at some vertex, visit each other vertex exactly once, and return to the start?)
Example:
The sequence <a,d,h,k,g,c> forms a Hamiltonian Circuit
The reduction: Is from VC, and it’s nuts. G&J do it on pages 56-60. Starting with an instance of VC (A graph G, and an integer K), build a new graph G’ with:
- K “selector” vertices (a1-ak)
- 12 vertices and 14 edges (see page 57) for each edge in G (a “cover-testing” component
- Edges to connect the selector vertices to the start and end of the cover-testing component.
The Cormen algorithms book has an example of this, and it takes a graph with 4 vertices and 4 edges and builds a HC instance with 50 vertices and 72 edges.
Difficulty: 9, only because I’m sure there exist reductions that have like 25 page proofs, and I want to save my 10 for that. But really, I think just making the students trace this reduction on an example is a really hard problem.
Posted in Core Problems
Tagged core problems, Difficulty 9, Hamiltonian Circuit, reductions, Vertex Cover