Phase transition in the controllability of temporal networks.
Márton PósfaiPhilipp HövelPublished in: CoRR (2013)
Keyphrases
- phase transition
- average degree
- small world networks
- simple temporal
- constraint satisfaction
- satisfiability problem
- graph coloring
- np complete
- hard problems
- temporal reasoning
- randomly generated
- temporal constraints
- combinatorial problems
- random constraint satisfaction problems
- random graphs
- sat problem
- hamiltonian cycle
- temporal information
- social networks
- np complete problems
- random instances
- deep structure
- community structure
- network structure
- cellular automata
- evolutionary algorithm
- search space