โ Scribed by Peter Eades; John Staples
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let T be a tree with n nodes from which edges are deleted interspersed with m on-line connectivity queries. Even and Shiloach gave an 0( n log n + m) algorithm to process edge deletion and m queries (Even and Shiloach, 1981). In this paper we present an O(n + m) algorithm for the same problem. @ 199
We present a polynomial-time greedy algorithm that assigns proper wavelengths to a set of requests of maximum load L per directed fiber link on a directed fiber tree using at most 5/3L wavelengths. This improves previous results of Raghavan and Upfal (Proc.
We present fast new algorithms for constructing phylogenetic trees from quar-ลฝ . tets resolved trees on four leaves . The problem is central to divide-and-conquer approaches to phylogenetic analysis and has been receiving considerable attention from the computational biology community. Most formulat