785 search results - page 34 / 157 » Embedding a Forest in a Graph |
GD
2009
Springer
13 years 6 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
PKDD
2009
Springer
14 years 3 months ago
2009
Springer
Existing feature extraction methods explore either global statistical or local geometric information underlying the data. In this paper, we propose a general framework to learn fea...
SENSYS
2003
ACM
14 years 2 months ago
2003
ACM
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
STOC
2004
ACM
14 years 9 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...