Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree (Q2946014)
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
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree |
scientific article |
Statements
Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree (English)
0 references
15 September 2015
0 references
0.99999976
0 references
0.90651315
0 references
0.90018386
0 references
0.90010047
0 references
0.8976505
0 references
0.88584447
0 references
0.8837906
0 references
0.88374114
0 references
0 references
0.8775361
0 references
