Computational aspects of greedy partitioning of graphs (Q1702844): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s10878-017-0185-2 / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jco/Borowiecki18 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10878-017-0185-2 / rank | |||
Normal rank | |||
Latest revision as of 04:55, 11 December 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
0 references
