✦ LIBER ✦

A simple linear-time algorithm for in situ merging

✍ Scribed by Heikki Mannila; Esko Ukkonen

Book ID: 113162723
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 451 KB
Volume: 18
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(84)90112-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Expected time analysis of interpolation

Expected time analysis of interpolation merge — a simple new merging algorithm

✍ Sumanta Guha; Arunabha Sen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 447 KB

Simple linear time approximation algorit

Simple linear time approximation algorithm for betweenness

✍ Yury Makarychev 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 349 KB

A Randomized Algorithm for Triangulating

A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time

✍ N. M. Amato; M. T. Goodrich; E. A. Ramos 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 220 KB

A Simple Linear Time LexBFS Cograph Reco

A Simple Linear Time LexBFS Cograph Recognition Algorithm

✍ Bretscher, Anna; Corneil, Derek; Habib, Michel; Paul, Christophe 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 250 KB

A simple polynomial-time rescaling algor

A simple polynomial-time rescaling algorithm for solving linear programs

✍ John Dunagan; Santosh Vempala 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 198 KB

A Simple Linear Time Algorithm for Trian

A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs

✍ H. Bodlaender; T. Kloks 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 560 KB

In this paper we consider the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added. This problem originated from the perfect phylogeny problem from molecular biology and is strongly related with the problem of recog