A computational complexity comparative study of graph tessellation problems (Q2222093)
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 7305081
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational complexity comparative study of graph tessellation problems |
scientific article; zbMATH DE number 7305081 |
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
0.87584084
0 references
0.86991847
0 references
0.86898595
0 references
0.8681017
0 references
0.8645326
0 references
0 references
