Sciweavers

420 search results - page 16 / 84
» Generating random regular graphs
Sort
View
FOCS
2009
IEEE
15 years 9 months ago
Faster Generation of Random Spanning Trees
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...
Jonathan A. Kelner, Aleksander Madry
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
15 years 2 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
ALENEX
2007
105views Algorithms» more  ALENEX 2007»
15 years 3 months ago
ScrewBox: a Randomized Certifying Graph-Non-Isomorphism Algorithm
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
Martin Kutz, Pascal Schweitzer
CRYPTO
2006
Springer
110views Cryptology» more  CRYPTO 2006»
15 years 6 months ago
On the Power of the Randomized Iterate
We consider two of the most fundamental theorems in Cryptography. The first, due to H
Iftach Haitner, Danny Harnik, Omer Reingold
LCN
2007
IEEE
15 years 8 months ago
Search Algorithms for Unstructured Peer-to-Peer Networks
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
Reza Dorrigiv, Alejandro López-Ortiz, Pawel...