A New Heuristic for Partitioning the Nodes of a Graph (Q3802647): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Q646640 / rank | |||
| Property / author | |||
| Property / author: Earl R. Barnes / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0401030 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134085311 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:25, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A New Heuristic for Partitioning the Nodes of a Graph |
scientific article |
Statements
A New Heuristic for Partitioning the Nodes of a Graph (English)
0 references
1988
0 references
linear programming
0 references
graph partitioning
0 references
