The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2010.12.014 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2010.12.014 / rank | |||
Normal rank | |||
Latest revision as of 08:58, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The P versus NP-complete dichotomy of some challenging problems in graph theory |
scientific article |
Statements
The P versus NP-complete dichotomy of some challenging problems in graph theory (English)
0 references
22 November 2012
0 references
analysis of algorithms
0 references
problem complexity
0 references
graph algorithms
0 references
structural characterization of types of graphs
0 references
0 references
