A computational complexity comparative study of graph tessellation problems (Q2222093)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational complexity comparative study of graph tessellation problems |
scientific article |
Statements
A computational complexity comparative study of graph tessellation problems (English)
0 references
3 February 2021
0 references
structural graph theory
0 references
computational complexity
0 references
tessellation cover
0 references
equivalence covering
0 references
0 references
0 references
