Sciweavers

736 search results - page 27 / 148
» Distinguishing geometric graphs
Sort
View
WAOA
2010
Springer
209views Algorithms» more  WAOA 2010»
13 years 6 months ago
Densest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
Danny Z. Chen, Rudolf Fleischer, Jian Li
ICDCS
2002
IEEE
14 years 1 months ago
Geometric Spanners for Wireless Ad Hoc Networks
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
Yu Wang 0003, Xiang-Yang Li
SODA
2001
ACM
126views Algorithms» more  SODA 2001»
13 years 10 months ago
Static and kinetic geometric spanners with applications
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
Menelaos I. Karavelas, Leonidas J. Guibas
SSS
2010
Springer
134views Control Systems» more  SSS 2010»
13 years 6 months ago
Storage Capacity of Labeled Graphs
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang C...
JUCS
2010
89views more  JUCS 2010»
13 years 3 months ago
A Geometrically Enhanced Conceptual Model and Query Language
: Motivated by our experiences with spatial modelling for the sustainable land use initiative we present a geometrically enhanced ER model (GERM), which preserves the key principle...
Hui Ma