𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Linear Time Algorithm forL(2,1)-Labeling of Trees

✍ Scribed by Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno

Book ID
120909993
Publisher
Springer
Year
2012
Tongue
English
Weight
926 KB
Volume
66
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Exact Algorithms forL(2,1)-Labeling of G
Exact Algorithms forL(2,1)-Labeling of Graphs
✍ FrΓ©dΓ©ric Havet; Martin Klazar; Jan KratochvΓ­l; Dieter Kratsch; Mathieu Liedloff πŸ“‚ Article πŸ“… 2009 πŸ› Springer 🌐 English βš– 850 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(