736 search results - page 20 / 148 » Distinguishing geometric graphs |
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
A geometric graph is a simple graph G = (V, E) with an embedding of the set V in the plane such that the points that represent V are in general position. A geometric graph is said...
SIROCCO
2001
13 years 9 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
CCCG
2008
13 years 10 months ago
2008
Given a collection of points representing geographic data we consider the task of delineating boundaries based on the features of the points. Assuming that the features are binary...
GECCO
2006
Springer
14 years 4 days ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...