Sciweavers

525 search results - page 7 / 105
» Bidimensionality and geometric graphs
Sort
View
GD
2009
Springer
14 years 4 days ago
Geometric Simultaneous Embeddings of a Graph and a Matching
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
Sergio Cabello, Marc J. van Kreveld, Giuseppe Liot...
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
13 years 8 months ago
Testing Euclidean Spanners
In this paper we develop a property testing algorithm for the problem of testing whether a directed geometric graph with bounded (out)degree is a (1 + )-spanner.
Frank Hellweg, Melanie Schmidt, Christian Sohler
CCCG
2009
13 years 8 months ago
On Graph Thickness, Geometric Thickness, and Separator Theorems
We investigate the relationship between geometric thickness and the thickness, outerthickness, and arboricity of graphs. In particular, we prove that all graphs with arboricity tw...
Christian A. Duncan
CORR
2012
Springer
200views Education» more  CORR 2012»
12 years 3 months ago
Harmonic evolutions on graphs
We define the harmonic evolution of states of a graph by iterative application of the harmonic operator (Laplacian over Z2). This provides graphs with a new geometric context and...
Jerzy Kocik
MOBIHOC
2001
ACM
14 years 7 months ago
Geometric spanner for routing in mobile networks
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...