✦ LIBER ✦

Linear-time construction of treaps and Cartesian trees

✍ Scribed by Mark Allen Weiss

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 352 KB
Volume: 52
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(94)00150-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on construction of treaps and car

A note on construction of treaps and cartesian trees

✍ M.A. Weiss 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 42 KB

Cartesian products of trees and paths

✍ Bandelt, Hans-J�rgen; Burosch, Gustav; Laborde, Jean-Marie 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 581 KB

We characterize the (weak) Cartesian products of trees among median graphs by a forbidden 5-vertex convex subgraph. The number of tree factors (if finite) is half the length of a largest isometric cycle. Then a characterization of Cartesian products of n trees obtains in terms of isometric cycles an

On the crossing numbers of Cartesian pro

On the crossing numbers of Cartesian products with trees

✍ Drago Bokal 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

## Abstract Zip product was recently used in a note establishing the crossing number of the Cartesian product __K__~1~,__n__ □ __P__~m~. In this article, we further investigate the relations of this graph operation with the crossing numbers of graphs. First, we use a refining of the embedding metho

A linear time algorithm for edge colorin

A linear time algorithm for edge coloring of binomial trees

✍ M. Kubale; K. Piwakowski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 448 KB

We consider the problem of efficient coloring of the edges of a so-called binomial tree T, i.e. acyclic graph containing two kinds of edges: those which must have a single color and those which are to be colored with L consecutive colors, where L is an arbitrary integer greater than 1. We give an O(

Construction of a tree from its traversa

Construction of a tree from its traversals in optimal time and space

✍ Arne Andersson; Svante Carlsson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 430 KB

Efficient Merging and Construction of Ev

Efficient Merging and Construction of Evolutionary Trees

✍ Andrzej Lingas; Hans Olsson; Anna Östlin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 99 KB

In this paper we study the algorithmic problem of constructing rooted evolutionary trees in the so-called experiment model. This model was first presented by Ž Ž . .