𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear time and space algorithm for finding isomorphic subtrees of a binary tree

✍ Scribed by Erkki Mäkinen

Publisher
Springer Netherlands
Year
1991
Tongue
English
Weight
216 KB
Volume
31
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 finding dept
A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
✍ Hon-Chan Chen; Yue-Li Wang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 458 KB

Let G be a connected graph of n vertices and m edges. The problem of finding a depth-first spanning tree of G is to find a subgraph of G connecting the n vertices with n -1 edges by depth-first search. In this paper, we propose an O(n) time algorithm for solving this problem on trapezoid graphs. Our

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