3471 search results - page 180 / 695 » Obstacle Numbers of Graphs |
173
click to vote
ICRA
2000
IEEE
15 years 9 months ago
2000
IEEE
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
140
click to vote
SDM
2008
SIAM
15 years 6 months ago
2008
SIAM
Web spam, which refers to any deliberate actions bringing to selected web pages an unjustifiable favorable relevance or importance, is one of the major obstacles for high quality ...
114
click to vote
ENTCS
2002
15 years 4 months ago
2002
In this work we present Zeus, a Distributed Model-Checker that evolves from the tool Kronos [8] and that currently can handle backwards computation of TCTLreachability properties ...
158
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
116
click to vote
IWPEC
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bou...