Computing roots of graphs is hard (Q1336641): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:05, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing roots of graphs is hard |
scientific article |
Statements
Computing roots of graphs is hard (English)
0 references
3 November 1994
0 references
undirected graph
0 references
