123 search results - page 4 / 25 » Simultaneous Geometric Graph Embeddings |
86
Voted
NETWORKS
2010
14 years 10 months ago
2010
COMBINATORICS
2006
15 years 6 days ago
2006
We expose a relationship between jamming and a generalization of Tutte's barycentric embedding. This provides a basis for the systematic treatment of jamming and maximal packi...
127
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...
181
Voted
MICCAI
2009
Springer
15 years 2 months ago
2009
Springer
We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic a...
STOC
2004
ACM
16 years 14 days 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...