Computing roots of graphs is hard (Q1336641)
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 681650
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing roots of graphs is hard |
scientific article; zbMATH DE number 681650 |
Statements
Computing roots of graphs is hard (English)
0 references
3 November 1994
0 references
undirected graph
0 references
0.8528909087181091
0 references
0.843344509601593
0 references
0.8424788117408752
0 references
0.8415728211402893
0 references
