2681 search results - page 355 / 537 » Problem F |
169
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
178
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
184
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
246
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
191
click to vote
IPSN
2011
Springer
14 years 10 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...