Computational complexity of covering disconnected multigraphs (Q6633538)
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 disconnected multigraphs |
scientific article; zbMATH DE number 7939389
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational complexity of covering disconnected multigraphs |
scientific article; zbMATH DE number 7939389 |
Statements
Computational complexity of covering disconnected multigraphs (English)
0 references
6 November 2024
0 references
graphs with multiple edges
0 references
loops and semi-edges
0 references
disconnected graphs
0 references
algorithms
0 references
NP-completeness
0 references