Computational aspects of greedy partitioning of graphs (Q1702844): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:06, 1 February 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
