Complexity of finding graph roots with girth conditions (Q2428666)
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 6028422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of finding graph roots with girth conditions |
scientific article; zbMATH DE number 6028422 |
Statements
Complexity of finding graph roots with girth conditions (English)
0 references
26 April 2012
0 references
graph roots
0 references
graph powers
0 references
recognition algorithms
0 references
NP-completeness
0 references
0.851939857006073
0 references
0.8456785678863525
0 references
0.8454117774963379
0 references
