Finding kth paths and p-centers by generating and searching good data structures (Q4747524)
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 3804863
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding kth paths and p-centers by generating and searching good data structures |
scientific article; zbMATH DE number 3804863 |
Statements
Finding kth paths and p-centers by generating and searching good data structures (English)
0 references
1983
0 references
representation of the set of intervertex distances of a tree
0 references
path selection
0 references
p-center location
0 references
networks with independent cycles
0 references
