-
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 5
Protected: Minimum Cut Into Bounded Sets
Enter your password to view comments.
Posted in Appendix- Network Design
Tagged Bipartite Subgraph, Difficulty 5, Difficulty 6, Max Cut, Minimum Cut into Bounded Sets, ND16, ND17, Simple Max-Cut
Protected: Graph Partitioning
Enter your password to view comments.
Posted in Appendix- Network Design
Tagged Difficulty 5, Graph Partitioning, ND14, Partition Into Triangles, uncited reduction
Protected: Kth Largest Subset and Turing Reductions
Enter your password to view comments.
Posted in Appendix- Sets and Partitions
Tagged Difficulty 5, Kth Largest Subset, Part, SP20, Turing Reduction
Protected: Network Survivability
Enter your password to view comments.
Posted in Appendix- Network Design
Tagged Difficulty 4, Difficulty 5, Difficulty 8, Dominating Set on Bipartite Graphs, Network Reliability, Network Survivability, uncited reduction
Protected: Maximum Leaf Spanning Tree, Connected Dominating Set
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: Path Distinguishers
Enter your password to view comments.
Posted in Appendix-Graph Theory
Tagged Difficulty 5, Difficulty 7, GT60, Path Distinguisters, Uniconnected subgraph, Vertex Cover
Protected: Path With Forbidden Pairs
Enter your password to view comments.
Posted in Appendix-Graph Theory
Tagged 3-sat, Difficulty 5, GT54, Path With Forbidden Pairs, uncited reduction
Protected: Maximum Subgraph Matching
Enter your password to view comments.
Posted in Appendix-Graph Theory
Tagged Clique, Difficulty 2, Difficulty 5, GT48, GT50, Largest Common Subgraph, Maximum Subgraph Matching, No G&J reference, Subgraph Isomorphism, uncited reduction
Protected: Three-Occurrence 3SAT
Enter your password to view comments.
Posted in Appendix-Logic, Problems not in appendix
Tagged Difficulty 5, Edge Subgraph, LO1, Three Occurrence 3-sat, uncited reduction
Protected: Hamiltonian Path on Bipartite Graphs
Enter your password to view comments.
Posted in Appendix-Graph Theory
Tagged Difficulty 5, Hamiltonian Circuit, Hamiltonian Path, Hamiltonian Path on Bipartite Graphs, Not in Appendix