On computational aspects of greedy partitioning of graphs (Q4632201)
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: On Computational Aspects of Greedy Partitioning of Graphs |
scientific article; zbMATH DE number 7048098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computational aspects of greedy partitioning of graphs |
scientific article; zbMATH DE number 7048098 |
Statements
On Computational Aspects of Greedy Partitioning of Graphs (English)
0 references
26 April 2019
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.7796223759651184
0 references
0.7792328000068665
0 references
