Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (Q1613360): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Douglas Bauer / rank | |||
Property / author | |||
Property / author: Hajo J. Broersma / rank | |||
Property / author | |||
Property / author: Aurora Morgana / rank | |||
Property / author | |||
Property / author: Edward F. Schmeichel / rank | |||
Property / author | |||
Property / author: Douglas Bauer / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Hajo J. Broersma / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Aurora Morgana / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Edward F. Schmeichel / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recognizing tough graphs is NP-hard / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple proof of a theorem of Jung / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of recognizing tough graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Long cycles in graphs with large degree sums / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4350166 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5187226 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on Hamiltonian circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Structure of Non-Hamiltonian Graphs I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-Completeness of Edge-Coloring / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 25 pretty graph colouring problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Maximal Circuits in Finite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cycle lengths and chromatic number of graphs / rank | |||
Normal rank |
Latest revision as of 16:21, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion |
scientific article |
Statements
Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion (English)
0 references
29 August 2002
0 references
toughness
0 references
hamiltonian graph theory
0 references