Loading...

Spanning trees in random satisfiability problems

Ramezanpour, A ; Sharif University of Technology | 2006

156 Viewed
  1. Type of Document: Article
  2. DOI: 10.1088/0305-4470/39/18/008
  3. Publisher: 2006
  4. Abstract:
  5. Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning trees in the associated factor graph. We introduce a modified survey propagation algorithm which returns null edges of the factor graph and helps us to find satisfiable spanning trees. This allows us to study organization of satisfiable spanning trees in the space spanned by spanning trees. © 2006 IOP Publishing Ltd
  6. Keywords:
  7. Sharif University of Technology
  8. Source: Journal of Physics A: Mathematical and General ; Volume 39, Issue 18 , 2006 , Pages 4901-4909 ; 03054470 (ISSN)
  9. URL: https://iopscience.iop.org/article/10.1088/0305-4470/39/18/008