On the Hardness of SAT with Community Structure.
Nathan MullDaniel J. FremontSanjit A. SeshiaPublished in: SAT (2016)
Keyphrases
- community structure
- phase transition
- community detection
- complex networks
- satisfiability problem
- social networks
- sat problem
- sat solvers
- np complete
- constraint satisfaction
- overlapping communities
- network analysis
- real world networks
- stochastic local search
- communities in social networks
- scale free
- randomly generated
- sat instances
- propositional satisfiability
- community detection algorithms
- random graphs
- search algorithm
- biological networks
- network structure
- computational complexity
- information retrieval
- search strategies
- np complete problems
- community discovery
- social network analysis
- max sat
- data mining
- topological information
- graph mining
- image segmentation
- community mining