Computational aspects of greedy partitioning of graphs (Q1702844)
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 aspects of greedy partitioning of graphs |
scientific article; zbMATH DE number 6845587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational aspects of greedy partitioning of graphs |
scientific article; zbMATH DE number 6845587 |
Statements
Computational aspects of greedy partitioning of graphs (English)
0 references
1 March 2018
0 references
graph partitioning
0 references
computational complexity
0 references
graph coloring
0 references
greedy algorithm
0 references
Grundy number
0 references
minimal graphs
0 references
0 references
0.9693081378936768
0 references
0.7774621248245239
0 references
0.7745157480239868
0 references
0.7737113237380981
0 references
