1172 search results - page 77 / 235 » Path Algorithms on Regular Graphs |
93
Voted
GD
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
124
Voted
SSD
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. Knowledge discovery in databases (KDD) is an important task in spatial databases since both, the number and the size of such databases are rapidly growing. This paper int...
134
click to vote
IJACTAICIT
2010
14 years 9 months ago
2010
In this work, a Modified Vector Field Histogram (MVFH) has been developed to improve path planning and obstacle avoidance for a wheeled driven mobile robot. It permits the detecti...
117
Voted
DAGM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We consider the classification problem on a finite set of objects. Some of them are labeled, and the task is to predict the labels of the remaining unlabeled ones. Such...
99
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...