𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal node ranking of trees in linear time

✍ Scribed by Alejandro A. Schäffer

Book ID
107765866
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
926 KB
Volume
33
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal node ranking of trees
Optimal node ranking of trees
✍ Ananth V. Iyer; H.Donald Ratliff; G. Vijayan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 671 KB
Optimal one-page tree embeddings in line
Optimal one-page tree embeddings in linear time
✍ Robert A. Hochberg; Matthias F. Stallmann 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 167 KB

In the minimum linear arrangement problem one wishes to assign distinct integers to the vertices of a given graph so that the sum of the differences (in absolute value) across the edges of the graph is minimized. This problem is known to be NP-complete for the class of all graphs, but polynomial for

An optimal parallel algorithm for node r
An optimal parallel algorithm for node ranking of cographs
✍ Liu Chuan-Ming; Yu Ming-Shing 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 885 KB

A ranking of a graph G is a mapping, p, from the vertices of G to the natural numbers such that for every path between any two vertices u and u, uf II, with p(u) = p(u), there exists at least one vertex w on that path with p(w) > p(u) = p(u). The value p(u) of a vertex u is the rank of vertex II. A