A sufficiently fast algorithm for finding close to optimal junction trees. Becker, A. and Geiger, D. In pages 81-89.
bibtex   
@InProceedings{becker1996,
  Title                    = {A sufficiently fast algorithm for finding close to optimal junction trees},
  Author                   = {Becker, A. and Geiger, D.},
  Pages                    = {81-89},

  Crossref                 = {uai1996}
}
Downloads: 0