Computational aspects of greedy partitioning of graphs (Q1702844): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q59610242, #quickstatements; #temporary_batch_1710972793655 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59610242 / rank | |||
Normal rank | |||
Revision as of 23:17, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational aspects of greedy partitioning of graphs |
scientific article |
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
