The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The P versus NP-complete dichotomy of some challenging problems in graph theory |
scientific article; zbMATH DE number 6109915
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The P versus NP-complete dichotomy of some challenging problems in graph theory |
scientific article; zbMATH DE number 6109915 |
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
0.7816520929336548
0 references
0.764232337474823
0 references
0.745543360710144
0 references
0.744284987449646
0 references
0.7395632863044739
0 references
