Detecting randomwalks hidden in noise: Phase transition on large graphs.
Ameya AgaskarYue M. LuPublished in: ICASSP (2013)
Keyphrases
- phase transition
- random graphs
- average degree
- hamiltonian cycle
- constraint satisfaction
- small world networks
- hard problems
- satisfiability problem
- randomly generated
- graph coloring
- np complete
- combinatorial problems
- graph matching
- np complete problems
- random instances
- cellular automata
- sat problem
- relational learning
- directed graph
- special case
- graph mining
- davis putnam
- dynamic programming