Sciweavers

172 search results - page 10 / 35
» Planar Graphs with Topological Constraints
Sort
View
PODS
2000
ACM
102views Database» more  PODS 2000»
14 years 2 months ago
Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic
We consider spatial databases in the plane that can be defined by polynomial constraint formulas. Motivated by applications in geographic information systems, we investigate line...
Floris Geerts, Bart Kuijpers
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 10 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
SMI
2010
IEEE
165views Image Analysis» more  SMI 2010»
13 years 7 months ago
Designing a Topological Modeler Kernel: A Rule-Based Approach
In this article, we present a rule-based language dedicated to topological operations, based on graph transformations. Generalized maps are described as a particular class of graph...
Thomas Bellet, Mathieu Poudret, Agnès Arnou...
MOBIHOC
2001
ACM
14 years 9 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 ...
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 10 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...