Comparing universal covers in polynomial time (Q987372): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00224-009-9200-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00224-009-9200-Z / rank | |||
Normal rank | |||
Latest revision as of 11:26, 10 December 2024
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
