3192 search results - page 246 / 639 » The minimum latency problem |
176
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
189
click to vote
WAOA
2007
Springer
16 years 18 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
192
click to vote
COCOON
2005
Springer
16 years 1 days ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
188
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
130
click to vote
ICRA
1994
IEEE
15 years 10 months ago
1994
IEEE
In this paper, we are concerned with the problem of location of inspection centers in a multistage manufacturing system. A Genetic algorithm based approach is developed to determi...