Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5915796)
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 6822005
| 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 6822005 |
Statements
Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (English)
0 references
4 January 2018
0 references
0.9677319526672364
0 references
0.8396111130714417
0 references
0.821715235710144
0 references
0.82029128074646
0 references
0.8107303380966187
0 references
