Comparing universal covers in polynomial time (Q987372)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5770218
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Comparing universal covers in polynomial time |
scientific article; zbMATH DE number 5770218 |
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
0.980291187763214
0 references
0.7675926685333252
0 references
0.753886878490448
0 references
0.749753475189209
0 references
