An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems (Q3906433): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q761346 |
Changed an Item |
||
| Property / author | |||
| Property / author: Eitan Zemel / rank | |||
Normal rank | |||
Revision as of 00:44, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems |
scientific article |
Statements
An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems (English)
0 references
1981
0 references
polynomial algorithm
0 references
selection
0 references
