Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Genus characterizes the complexity of certain graph problems: Some tight results |
scientific article |
Statements
Genus characterizes the complexity of certain graph problems: Some tight results (English)
0 references
23 August 2007
0 references
parameterized computation
0 references
subexponential time computation
0 references
polynomial time approximation scheme
0 references
graph genus
0 references
0 references
0 references
0 references
