1163 search results - page 87 / 233 » Embedding into Bipartite Graphs |
COMPGEOM
2010
ACM
14 years 1 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 8 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...
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...
DM
1998
13 years 7 months ago
1998
An embedding of Kn into a hypercube is a mapping of the n vertices of Kn to distinct vertices of the hypercube, and the associated cost is the sum over all pairs of (mapped) verti...
GD
2009
Springer
14 years 21 days ago
2009
Springer
In this paper, we explore a new convention for drawing graphs, the (Manhattan-) geodesic drawing convention. It requires that edges are drawn as interior-disjoint monotone chains o...