Login / Signup
#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region.
Jin-Yi Cai
Andreas Galanis
Leslie Ann Goldberg
Heng Guo
Mark Jerrum
Daniel Stefankovic
Eric Vigoda
Published in:
APPROX-RANDOM (2014)
Keyphrases
</>
bounded degree
graph theoretic
relational databases
graph partitioning
tree structure
graph matching
computational complexity
bounded treewidth
graph model
database
bipartite graph
link prediction
spanning tree
sufficient conditions
domain knowledge
minimum spanning tree
query processing