Computing roots of graphs is hard (Q1336641): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:58, 5 March 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
