Sciweavers

7 search results - page 2 / 2
» Controlled non uniform random generation of decomposable str...
Sort
View
ISAAC
2005
Springer
123views Algorithms» more  ISAAC 2005»
13 years 11 months ago
Sampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
ET
2000
145views more  ET 2000»
13 years 5 months ago
Fast Test Pattern Generation for Sequential Circuits Using Decision Diagram Representations
The paper presents a novel hierarchical approach to test pattern generation for sequential circuits based on an input model of mixed-level decision diagrams. A method that handles,...
Jaan Raik, Raimund Ubar