310 search results - page 36 / 62 » dam 2008 |
DAM
2002
13 years 9 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
DAM
2002
13 years 9 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
DAM
1998
13 years 9 months ago
1998
M-convex functions, introduced by Murota (1996, 1998), enjoy various desirable properties as “discrete convex functions.” In this paper, we propose two new polynomial-time sca...
DAM
1999
13 years 9 months ago
1999
Compound methods have been shown to be very e ective in the construction of broadcast graphs. Compound methods generate a large broadcast graph by combining multiple copies of a b...
DAM
1999
13 years 9 months ago
1999
We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for th...