scientific article; zbMATH DE number 7238987

DOI10.4230/LIPICS.SWAT.2018.32zbMATH Open1477.68217arXiv1706.07900MaRDI QIDQ5116496FDOQ5116496

Mikhail Rudoy, Erik D. Demaine

Publication date: 25 August 2020

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

Title of this publication is not available (Why is that?)

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)

Cites Work

• Title not available (Why is that?)
• 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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Generalized hypertree decompositions: NP-hardness and tractable variants 👍 👎
• A complexity gap for tree resolution 👍 👎
• A lower bound for tree resolution 👍 👎
• Lifting lower bounds for tree-like proofs 👍 👎
• Finding a tree structure in a resolution proof is NP-complete 👍 👎
• On resolvable tree-decompositions of complete graphs 👍 👎
• Strong hardness of approximation for tree transversals 👍 👎
• Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width 👍 👎

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)