Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs (Q3557058): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q396628 |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Marek Karpinski / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_57 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1558898895 / rank | |||
Normal rank |
Latest revision as of 01:38, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs |
scientific article |
Statements
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs (English)
0 references
27 April 2010
0 references