Random threshold graphs with exponential fitness: The width of the phase transition for connectivity.
Armand M. MakowskiOsman YaganPublished in: ISIT (2013)
Keyphrases
- random constraint satisfaction problems
- phase transition
- random graphs
- random instances
- average degree
- hamiltonian cycle
- randomly generated
- constraint satisfaction
- satisfiability problem
- small world networks
- hard problems
- np complete
- easy hard easy pattern
- sat problem
- graph coloring
- graph theory
- genetic algorithm
- random sat
- fitness function
- graph matching
- graph theoretic
- np complete problems
- genetic programming
- connected components
- undirected graph
- constraint satisfaction problems
- lower bound
- search space
- directed graph
- subgraph isomorphism
- cellular automata
- graph model
- weighted graph