Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii (Q5459152)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5267623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii |
scientific article; zbMATH DE number 5267623 |
Statements
Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii (English)
0 references
24 April 2008
0 references
Graph partition
0 references
Facility location problems
0 references
Clustering problems
0 references
Graph radius
0 references
NP-hardness
0 references
0.8866245150566101
0 references
0.7999208569526672
0 references
0.7743012309074402
0 references
