Sciweavers

202 search results - page 14 / 41
» On the Queue Number of Planar Graphs
Sort
View
90
Voted
ICRA
1999
IEEE
138views Robotics» more  ICRA 1999»
15 years 4 months ago
Efficient Topological Exploration
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
Ioannis M. Rekleitis, Vida Dujmovic, Gregory Dudek
RSA
2010
64views more  RSA 2010»
14 years 10 months ago
Vertices of given degree in series-parallel graphs
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...
Michael Drmota, Omer Giménez, Marc Noy
COMPGEOM
2006
ACM
15 years 5 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
JGAA
2002
86views more  JGAA 2002»
14 years 11 months ago
Planar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
Christoph Dornheim
CIAC
2006
Springer
100views Algorithms» more  CIAC 2006»
15 years 3 months ago
Distributed Approximation Algorithms for Planar Graphs
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...