✦ LIBER ✦

A linear algorithm for compact box-drawings of trees

✍ Scribed by Masud Hasan; Md. Saidur Rahman; Takao Nishizeki

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 100 KB
Volume: 42
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.10092

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Simple Linear Time Algorithm for Prope

A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs

✍ Xin He 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 219 KB

In this paper we introduce a new style of drawing a plane graph G, called proper Ž . box rectangular PBR drawing. It is defined to be a drawing of G such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal or a vertical line segment, and each face is dr

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

A linear algorithm for finding the k-bro

A linear algorithm for finding the k-broadcast center of a tree

✍ Hovhannes A. Harutyunyan; Arthur L. Liestman; Bin Shao 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

A linear-time algorithm for connectedr-d

A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs

✍ Brandst�dt, Andreas; Dragan, Feodor F. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

A distance-hereditary graph is a connected graph in which every induced path is isometric, i.e., the distance of any two vertices in an induced path equals their distance in the graph. We present a linear time labeling algorithm for the minimum cardinality connected r-dominating set and Steiner tree

A Simple Optimal Parallel Algorithm for

A Simple Optimal Parallel Algorithm for a Core of a Tree

✍ S.T. Peng; W.T. Lo 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 354 KB

A core of a tree \(T=(V, E)\) is a path in \(T\) which minimizes \(\Sigma_{v \in V}\) \(d(v, P)\), where \(d(v, P)\), the distance from a vertex \(v\) to path \(P\), is defined as \(\min _{u \in P} d(v, u)\). We present an optimal parallel algorithm to find a core of \(T\) in \(O(\log n)\) time usin