180 search results - page 35 / 36 » Minimum congestion spanning trees in planar graphs |
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
IROS
2007
IEEE
13 years 11 months ago
2007
IEEE
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
TSP
2008
13 years 5 months ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
COMPGEOM
2006
ACM
13 years 9 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...