Finding kth paths and p-centers by generating and searching good data structures (Q4747524): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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.1016/0196-6774(83)90035-4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996896896 / rank | |||
Normal rank | |||
Latest revision as of 22:04, 19 March 2024
scientific article; zbMATH DE number 3804863
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
