Sciweavers

198 search results - page 3 / 40
» A Sequential Algorithm for Generating Random Graphs
Sort
View
TCS
2010
13 years 2 months ago
Parametric random generation of deterministic tree automata
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
Pierre-Cyrille Héam, Cyril Nicaud, Sylvain ...
STOC
2003
ACM
109views Algorithms» more  STOC 2003»
14 years 7 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
ICALP
2003
Springer
14 years 19 days ago
Generating Labeled Planar Graphs Uniformly at Random
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
ICOIN
2004
Springer
14 years 24 days ago
On Generating Random Network Structures: Connected Graphs
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
Alexey S. Rodionov, Hyunseung Choo
DATE
1999
IEEE
111views Hardware» more  DATE 1999»
13 years 11 months ago
Sequential Circuit Test Generation Using Decision Diagram Models
A novel approach to testing sequential circuits that uses multi-level decision diagram representations is introduced. The proposed algorithm consists of a combination of scanning ...
Jaan Raik, Raimund Ubar