723 search results - page 10 / 145 » On the hyperbolicity constant in graphs |
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
FOCS
2003
IEEE
14 years 21 days ago
2003
IEEE
We show that random graphs in the preferential connectivity model have constant conductance, and hence have worst-case routing congestion that scales logarithmically with the numb...
EMMCVPR
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. The Mumford-Shah model has been one of the most powerful models in image segmentation and denoising. The optimization of the multiphase Mumford-Shah energy functional has...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
IPMU
2010
Springer
13 years 9 months ago
2010
Springer
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...