1591 search results - page 26 / 319 » Random lifts of graphs |
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
112
Voted
FOCS
2003
IEEE
15 years 6 months 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...
127
click to vote
COLOGNETWENTE
2010
14 years 11 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
102
click to vote
RANDOM
1998
Springer
15 years 5 months ago
1998
Springer
There has been a significant amount of research lately on solving the edge disjoint path and related problems on expander graphs. We review the random walk approach of Broder, Fri...
120
Voted
ALGORITHMICA
2010
15 years 26 days ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...