Comparing universal covers in polynomial time (Q987372)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparing universal covers in polynomial time |
scientific article |
Statements
Comparing universal covers in polynomial time (English)
0 references
13 August 2010
0 references
graph homomorphism
0 references
universal cover
0 references
computational complexity
0 references
degree matrix
0 references
0 references
