scientific article; zbMATH DE number 7238987

DOI10.4230/LIPICS.SWAT.2018.32MaRDI QIDQ5116496zbMATH OpenFDO

Authors Erik D. Demaine, Mikhail Rudoy

Publication date 25 August 2020

Full work available at URL https://arxiv.org/abs/1706.07900

zbMATH Keywords

graphsNP-hardnessHamiltonicityhypergraph spanning tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Strong hardness of approximation for tree transversals
• Beating brute force for (quantified) satisfiability of circuits of bounded treewidth
• scientific article; zbMATH DE number 1335884
• Efficient arbitrary and resolution proofs of unsatisfiability for restricted tree-width
• A complexity gap for tree resolution
• Finding a tree structure in a resolution proof is NP-complete
• Lifting lower bounds for tree-like proofs
• On resolvable tree-decompositions of complete graphs
• Generalized hypertree decompositions: NP-hardness and tractable variants
• A lower bound for tree resolution

Cites work

• scientific article; zbMATH DE number 970831 (Why is no real title available?)
• Matroid matching and some applications
• The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two

Cited in

(2)

• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116496)