Sciweavers

420 search results - page 1 / 84
» Generating random regular graphs
Sort
View
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
14 years 5 months ago
Generating random regular graphs
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
Jeong Han Kim, Van H. Vu
CPC
1999
76views more  CPC 1999»
13 years 4 months ago
Generating Random Regular Graphs Quickly
Angelika Steger, Nicholas C. Wormald
SPAA
2005
ACM
13 years 10 months ago
Peer-to-peer networks based on random transformations of connected regular undirected graphs
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
Peter Mahlmann, Christian Schindelhauer
CORR
2002
Springer
113views Education» more  CORR 2002»
13 years 4 months ago
Generic-case complexity, decision problems in group theory and random walks
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...
Ilya Kapovich, Alexei G. Myasnikov, Paul Schupp, V...
LATIN
2000
Springer
13 years 8 months ago
Small Maximal Matchings in Random Graphs
We look at the minimal size of a maximal matching in general, bipartite and
Michele Zito