On Communication Protocols in Unreliable Mesh Networks and their Relation to Phase Transitions.
Martin NehézDusan BernátPublished in: PDCS (2004)
Keyphrases
- communication protocols
- phase transition
- constraint satisfaction
- random constraint satisfaction problems
- satisfiability problem
- communication protocol
- combinatorial problems
- randomly generated
- np complete
- graph coloring
- hard problems
- communication networks
- random graphs
- sat problem
- np complete problems
- random instances
- protocol specification
- end to end
- objective function
- cellular automata
- constraint satisfaction problems