3471 search results - page 269 / 695 » Obstacle Numbers of Graphs |
181
click to vote
JAL
2006
15 years 6 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
181
click to vote
TCS
2008
15 years 6 months ago
2008
Following the decontamination metaphor for searching a graph, we introduce a cleaning process, which is related to both the chip-firing game and edge searching. Brushes (instead o...
177
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing...
185
click to vote
IWOMP
2009
Springer
16 years 1 months ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
137
click to vote
DASFAA
2007
IEEE
16 years 1 months ago
2007
IEEE
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...