Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs

DOI10.1007/978-3-642-12200-2_57zbMath1283.05155MaRDI QIDQ3557058

Andrzej Ruciński, Edyta Szymańska, Marek Karpinski

Publication date: 27 April 2010

Published in: LATIN 2010: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_57

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C65: Hypergraphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

05C45: Eulerian and Hamiltonian graphs

Related Items

Hamilton cycles in hypergraphs below the Dirac threshold, The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree