Graph isomorphism parameterized by elimination distance to bounded degree (Q309797)
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: Graph isomorphism parameterized by elimination distance to bounded degree |
scientific article; zbMATH DE number 6624623
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph isomorphism parameterized by elimination distance to bounded degree |
scientific article; zbMATH DE number 6624623 |
Statements
Graph isomorphism parameterized by elimination distance to bounded degree (English)
0 references
7 September 2016
0 references
graph isomorphism
0 references
canonization
0 references
parameterized complexity
0 references
fixed-parameter tractable
0 references
bounded degree
0 references
graph theory
0 references
complexity theory
0 references
tree-depth
0 references
0 references
0 references
