Frederickson, Greg N.; Johnson, Donald B. Finding kth paths and p-centers by generating and searching good data structures. (English) Zbl 0509.68057 J. Algorithms 4, 61-80 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 50 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 05C05 Trees 68P10 Searching and sorting 68P05 Data structures 68W99 Algorithms in computer science Keywords:representation of the set of intervertex distances of a tree; path selection; p-center location; networks with independent cycles PDFBibTeX XMLCite \textit{G. N. Frederickson} and \textit{D. B. Johnson}, J. Algorithms 4, 61--80 (1983; Zbl 0509.68057) Full Text: DOI