On Computational Aspects of Greedy Partitioning of Graphs (Q4632201): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q62043601, #quickstatements; #temporary_batch_1712261475387 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q62043601 / rank | |||
Normal rank | |||
Revision as of 22:33, 4 April 2024
scientific article; zbMATH DE number 7048098
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
