Polynomially bounded algorithms for locatingp-centers on a tree (Q3947422)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomially bounded algorithms for locatingp-centers on a tree |
scientific article; zbMATH DE number 3765512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomially bounded algorithms for locatingp-centers on a tree |
scientific article; zbMATH DE number 3765512 |
Statements
Polynomially bounded algorithms for locatingp-centers on a tree (English)
0 references
1982
0 references
perfect graphs
0 references
dual location model
0 references
rigid circuit graphs
0 references
undirected tree network
0 references
polynomial algorithm
0 references
p-center location problem
0 references
location on a tree
0 references
