3471 search results - page 102 / 695 » Obstacle Numbers of Graphs |
GD
2009
Springer
14 years 17 days ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Menger's paths between the sources and the sinks such that the number...
DAM
2007
13 years 9 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
IROS
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— We present a computational framework for automatic deployment of robots in 2D and 3D rectangular environments with polytopal obstacles. The results are derived for poly...
HICSS
2002
IEEE
14 years 2 months ago
2002
IEEE
Abstract. In this paper we describe several new clustering algorithms for nodes in a mobile ad hoc network. The main contribution is to generalize the cluster definition and forma...