𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear-time algorithm for the generation of trees

✍ Scribed by L. Alonso; J. L. Rémy; R. Schott

Book ID
110547315
Publisher
Springer
Year
1997
Tongue
English
Weight
908 KB
Volume
17
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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(

A Linear Time Algorithm for Finding ak-T
A Linear Time Algorithm for Finding ak-Tree Core
✍ Akiyoshi Shioura; Takeaki Uno 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 173 KB

Given a tree containing n vertices, consider the sum of the distance between all Ž . vertices and a k-leaf subtree subtree which contains exactly k leaves . A k-tree core is a k-leaf subtree which minimizes the sum of the distances. In this paper, we propose a linear time algorithm for finding a k-t

A linear-time algorithm for broadcast do
A linear-time algorithm for broadcast domination in a tree
✍ John Dabney; Brian C. Dean; Stephen T. Hedetniemi 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

## Abstract The broadcast domination problem is a variant of the classical minimum dominating set problem in which a transmitter of power __p__ at vertex __v__ is capable of dominating (broadcasting to) all vertices within distance __p__ from __v__. Our goal is to assign a broadcast power __f__(__v