✦ LIBER ✦

A Linear Time Lower Bound on McCreight and General Updating Algorithms for Suffix Trees

✍ Scribed by Mauricio Ayala-Rincón; Paulo D. Conejo

Publisher: Springer
Year: 2003
Tongue: English
Weight: 157 KB
Volume: 37
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-003-1034-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast and versatile algorithm for nearest

Fast and versatile algorithm for nearest neighbor search based on a lower bound tree

✍ Yong-Sheng Chen; Yi-Ping Hung; Ting-Fang Yen; Chiou-Shann Fuh 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 431 KB

A linear-time algorithm for connectedr-d

A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs

✍ Brandst�dt, Andreas; Dragan, Feodor F. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

A distance-hereditary graph is a connected graph in which every induced path is isometric, i.e., the distance of any two vertices in an induced path equals their distance in the graph. We present a linear time labeling algorithm for the minimum cardinality connected r-dominating set and Steiner tree

Lower bounds and algorithms for flowtime

Lower bounds and algorithms for flowtime minimization on a single machine with set-up times

✍ Simon Dunstall; Andrew Wirth; Kenneth Baker 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 165 KB 👁 3 views

We consider the scheduling of N jobs divided into G families for processing on a single machine. No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i = j, the duration of this