Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286)
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 Graph Partition under Vertex-Compaction to an Irreflexive Hexagon |
scientific article; zbMATH DE number 7204403
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon |
scientific article; zbMATH DE number 7204403 |
Statements
26 May 2020
0 references
computational complexity
0 references
graph algorithms
0 references
graph partition
0 references
colouring
0 references
homomorphism
0 references
retraction
0 references
compaction
0 references
vertex-compaction
0 references
Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (English)
0 references
0.9020708799362184
0 references
0.8337527513504028
0 references
0.8063093423843384
0 references
0.8000532388687134
0 references
0.7886701226234436
0 references
