Computational complexity of covering three-vertex multigraphs (Q897866)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational complexity of covering three-vertex multigraphs |
scientific article; zbMATH DE number 6517431
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of covering three-vertex multigraphs |
scientific article; zbMATH DE number 6517431 |
Statements
Computational complexity of covering three-vertex multigraphs (English)
0 references
8 December 2015
0 references
computational complexity
0 references
graph homomorphism
0 references
covering projection
0 references
0.9963890314102172
0 references
0.8244476318359375
0 references
