Sciweavers

2079 search results - page 238 / 416
» Universality of random graphs
Sort
View
CC
2006
Springer
147views System Software» more  CC 2006»
15 years 6 months ago
Complexity of Ring Morphism Problems
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
Neeraj Kayal, Nitin Saxena
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 6 months ago
Directed animals in the gas
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert
COMBINATORICS
2007
67views more  COMBINATORICS 2007»
15 years 6 months ago
Directed Animals and Gas Models Revisited
In this paper, we revisit the enumeration of directed animals using gas models. We show that there exists a natural construction of random directed animals on any directed graph t...
Yvan Le Borgne, Jean-François Marckert
STTT
2008
86views more  STTT 2008»
15 years 6 months ago
Properties of state spaces and their applications
Explicit model checking algorithms explore the full state space of a system. State spaces are usually treated as directed graphs without any specific features. We gather a large co...
Radek Pelánek
ANTSW
2010
Springer
15 years 4 months ago
Theoretical Properties of Two ACO Approaches for the Traveling Salesman Problem
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
Timo Kötzing, Frank Neumann, Heiko Rögli...