✦ LIBER ✦

Linear algorithms on recursive representations of trees

✍ Scribed by S.L. Mitchell; E.J. Cockayne; S.T. Hedetniemi

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 623 KB
Volume: 18
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(79)90053-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recursive algorithms for the representat

Recursive algorithms for the representation of parametric curves and surfaces

✍ L. Piegl 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Representation of rational Béziel curves

Representation of rational Béziel curves and surfaces by recursive algorithms

✍ L. Piegl 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 371 KB

A linear algorithm for compact box-drawi

A linear algorithm for compact box-drawings of trees

✍ Masud Hasan; Md. Saidur Rahman; Takao Nishizeki 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

On Linear Representations of Near Hexago

On Linear Representations of Near Hexagons

✍ B De Bruyn; F De Clerck 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 169 KB

On the tree representation of chordal gr

On the tree representation of chordal graphs

✍ Yukio Shibata 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 344 KB 👁 1 views

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(