The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 07:58, 1 February 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