Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria (Q4638584): 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.1002/net.21661 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2182662656 / rank | |||
Normal rank | |||
Latest revision as of 23:56, 19 March 2024
scientific article; zbMATH DE number 6865278
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria |
scientific article; zbMATH DE number 6865278 |
Statements
Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria (English)
0 references
27 April 2018
0 references
\(p\)-centered partitions
0 references
tree partitioning
0 references
flat costs
0 references
min-sum criterion
0 references
min-max criterion
0 references
range criterion
0 references
uniform partitions
0 references
exactly uniform 2-centered partition
0 references
capacitated partitions
0 references
