"An O(n log2 n) Algorithm for the k-th Longest Path in a Tree ..."

Nimrod Megiddo et al. (1981)

> Home

Details and statistics

DOI: 10.1137/0210023

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/MegiddoTZC81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/MegiddoTZC81
Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran:
An O(n log² n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. SIAM J. Comput. 10(2): 328-337 (1981)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.