Noriyoshi Yoshida

A linear algorithm for the domination number of a series-parallel graph

Abstract A vertex u in an undirected graph G = (V, E) is said to dominate all its adjacent vertices and itself. A subset D of V is a dominating set in G if every vertex in G is dominated by a vertex in D, and is a minimum dominating set in G if no other dominating set in G has fewer vertices than D. The domination number of G is the cardinality of a minimum dominating set in G. The problem of determining, for a given positive integer k and an undirected graph G, whether G has a dominating set D in G satisfying ¦D¦ ≤ k, is a well-known NP-complete problem. Cockayne have presented a linear time algorithm for finding a minimum dominating set in a tree. In this paper, we will present a linear time algorithm for finding a minimum dominating set in a series-parallel graph.

A Meeting Scheduler for Office Automation

Scheduling of meetings is one of the basic functions demanded in office automation, since office workers spend much time on meetings. This paper discusses a schedufkng problem of meetings and presents a meeting scheduler for office automation which provides an automatic mechanism for updating a schedule of meetings.

A Deterministic Algorithm for Finding All Minimum

Let

k

G=(V,E)

-Way Cuts

be an edge-weighted undirected graph with

A Heuristic Algorithm for Gate Assignment in One-Dimensional Array Approach

n

An MCM routing algorithm considering crosstalk

vertices and

A new performance driven placement method with the Elmore delay model for row based VLSIs

m

Visualized and modeless programming environment for form manipulation language

edges. We present a deterministic algorithm to compute a minimum

An integrated approach to pin assignment and global routing for VLSI building-block layout

k