1161 search results - page 127 / 233 » Kinetic Dependence Graphs |
108
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
116
Voted
GD
2005
Springer
15 years 6 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
82
Voted
ECP
1997
Springer
15 years 4 months ago
1997
Springer
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which ref...
111
click to vote
CORR
2007
Springer
15 years 20 days ago
2007
Springer
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
110
click to vote
WG
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...