LINEAR VERIFICATION FOR SPANNING TREES (1985)
by
J. Komlos
| Venue: | COMBINATORICA 5 (I) (1985) 57--65 |
| Citations: | 21 - 0 self |
BibTeX
@MISC{Komlos85linearverification,
author = {J. Komlos},
title = { LINEAR VERIFICATION FOR SPANNING TREES},
year = {1985}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Given a rooted tree with values associated with the n vertices and a set A of directed paths (queries), we describe an algorithm which finds the maxinmm value of every one of the given paths. and which use ~ only I AI-i- n 5n--F n log--
Citations
| 1 | TARJAN, Finding Minimum Spanning - CHERITON, E - 1976 |
| 1 | TARJAN, private eommutdeation - N, E - 1983 |
| 1 | A Linear Time Algorithm for the Lowest - HARr - 1980 |
| 1 | TARTAN, Application of Path Compression - E - 1979 |
| 1 | An O(IE1 log log IV[) Algorithm for Finding Minimum Spanning Trees, Infi~rmation Processing - YAo - 1975 |
