Computational Complexity of Covering Three-Vertex Multigraphs (Q2922636): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_42 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W269794066 / rank | |||
Normal rank | |||
Latest revision as of 00:29, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational Complexity of Covering Three-Vertex Multigraphs |
scientific article |
Statements
Computational Complexity of Covering Three-Vertex Multigraphs (English)
0 references
14 October 2014
0 references
computational complexity
0 references
graph homomorphism
0 references
covering projection
0 references
