5606 search results - page 66 / 1122 » Randomization Techniques for Graphs. |
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
WDAG
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
STOC
1996
ACM
14 years 1 months ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
ESA
2004
Springer
14 years 2 months ago
2004
Springer
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...