Computational aspects of greedy partitioning of graphs (Q1702844): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-017-0185-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2767308712 / rank | |||
Normal rank | |||
Revision as of 21:39, 19 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
