#### Filter Results:

#### Publication Year

2001

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The <i>canonical ordering</i> for triconnected planar graphs is a powerful method for designing graph algorithms. This paper introduces the <i>orderly pair</i> of connected planar graphs, which extends the concept of canonical ordering to planar graphs not required to be triconnected.
Let <i>G</i> be a connected planar graph. We give a linear-time algorithm… (More)

—Power consumption is one of the most critical problems in data centers. One effective way to reduce power consumption is to consolidate the hosting workloads and shut down physical machines which become idle after consolidation. Server consolidation is a NP-hard problem. In this paper, a new algorithms Dynamic Round-Robin (DRR), is proposed for… (More)

We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of an embedded planar graph H… (More)

Let G be an n-node planar graph. In a visibility representation of G, each node of G is represented by a horizontal line segment such that the line segments representing any two adjacent nodes of G are vertically visible to each other. In the present paper we give the best known compact visibility representation of G. Given a canonical ordering of the… (More)

- Chih-Yuan Yeh, Chung-Yao Kao, Wei-Shu Hung, Ching-Chi Lin, Pangfeng Liu, Jan-Jan Wu +1 other
- GPC
- 2013

We consider the broadcasting problem in heterogeneous tree networks. A heterogeneous tree network is represented by a weighted tree T = (V, E) such that the weight of each edge denotes the communication time between the two end vertices. The broadcasting problem is to find a broadcast center such that the maximum communication time from the broadcast center… (More)