5889 search results - page 381 / 1178 » Graph Layout Problems |
188
click to vote
COR
2000
15 years 6 months ago
2000
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
221
Voted
AAIM
2007
Springer
16 years 1 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
169
click to vote
WDAG
2007
Springer
16 years 28 days ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
150
click to vote
IPL
2008
15 years 6 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
195
click to vote
PVLDB
2010
15 years 5 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...