The graph tessellation cover number: extremal bounds, efficient algorithms and hardness (Q2294676)
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 7166184
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The graph tessellation cover number: extremal bounds, efficient algorithms and hardness |
scientific article; zbMATH DE number 7166184 |
Statements
The graph tessellation cover number: extremal bounds, efficient algorithms and hardness (English)
0 references
12 February 2020
0 references
staggered quantum walk
0 references
clique graph
0 references
tessellation
0 references
0.9428803324699402
0 references
0.888355553150177
0 references
0.8778477907180786
0 references
