Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195)
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: Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 |
scientific article; zbMATH DE number 7057339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 |
scientific article; zbMATH DE number 7057339 |
Statements
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (English)
0 references
21 May 2019
0 references
graph square root
0 references
outerplanar graphs
0 references
graphs of pathwidth 2
0 references
0 references
0 references
0.9677319526672364
0 references
0.8337404131889343
0 references
0.8278912305831909
0 references
0.8142025470733643
0 references
0.8075141310691833
0 references
