On the Hardness of SAT with Community Structure.
Nathan MullDaniel J. FremontSanjit A. SeshiaPublished in: CoRR (2016)
Keyphrases
- community structure
- phase transition
- satisfiability problem
- complex networks
- community detection
- sat problem
- social networks
- real world networks
- sat solvers
- np complete
- stochastic local search
- network analysis
- constraint satisfaction
- community detection algorithms
- overlapping communities
- np hard
- communities in social networks
- np complete problems
- propositional satisfiability
- search algorithm
- sat instances
- network structure
- computational complexity
- randomly generated
- scale free
- biological networks
- bipartite networks
- random graphs
- small world
- community discovery
- orders of magnitude