Genus characterizes the complexity of certain graph problems: Some tight results (Q2641866)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5182129
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Genus characterizes the complexity of certain graph problems: Some tight results |
scientific article; zbMATH DE number 5182129 |
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
0 references
0 references
0.8984891
0 references
0.8969402
0 references
0 references
0 references
