328 search results - page 13 / 66 » Algorithms for the edge-width of an embedded graph |
INFOCOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
APPROX
2010
Springer
13 years 8 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...
ESA
2005
Springer
14 years 2 months ago
2005
Springer
We present an algorithm for finding shortest surface non-separating cycles in graphs embedded on surfaces in O(g3/2 V 3/2 log V + g5/2 V 1/2 ) time, where V is the number of vert...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
COMPGEOM
2007
ACM
14 years 18 days ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...