𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal Edge Ranking of Trees in Linear Time

✍ Scribed by T. W. Lam and F. L. Yue

Book ID
120137148
Publisher
Springer
Year
2001
Tongue
English
Weight
313 KB
Volume
30
Category
Article
ISSN
0178-4617

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
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(

On an edge ranking problem of trees and
On an edge ranking problem of trees and graphs
✍ Ananth.V. Iyer; H.Donald Ratliff; Gopalakrishnan Vijayan πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 724 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