723 search results - page 81 / 145 » On the hyperbolicity constant in graphs |
178
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
176
click to vote
DAM
2011
15 years 1 months ago
2011
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
138
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
155
click to vote
APPROX
2009
Springer
16 years 23 days ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
138
click to vote
ICRA
2006
IEEE
16 years 6 days ago
2006
IEEE
Abstract— We describe how a graph grammar program for robotic self-assembly, together with measurements of kinetic rate data yield a Markov Process model of the dynamics of progr...