5606 search results - page 298 / 1122 » Randomization Techniques for Graphs. |
171
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
A new graph reduction approach to symbolic circuit analysis is developed in this paper. A Binary Decision Diagram (BDD) mechanism is formulated, together with a specially designed ...
186
click to vote
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
We illustrate two ways to address the specification, modelling and analysis of dynamic software architectures using: i) ordinary typed graph transformation techniques implemented i...
185
click to vote
IPCO
1993
15 years 7 months ago
1993
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
161
click to vote
CCCG
2009
15 years 7 months ago
2009
We investigate the relationship between geometric thickness and the thickness, outerthickness, and arboricity of graphs. In particular, we prove that all graphs with arboricity tw...
149
click to vote
ICITS
2009
15 years 4 months ago
2009
In this article, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computat...