Computing roots of directed graphs is graph isomorphism hard (Q6471969)
From MaRDI portal
scientific article; zbMATH DE number 900011176
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing roots of directed graphs is graph isomorphism hard |
scientific article; zbMATH DE number 900011176 |
Statements
2 July 2002
0 references
math.CO
0 references
