"A sufficiently fast algorithm for finding close to optimal junction trees."

Ann Becker, Dan Geiger (1996)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2021-02-03

- view
  - electronic edition @ dslpitt.org (archived)
- export record
  dblp key:
  - conf/uai/BeckerG96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/uai/BeckerG96
Ann Becker, Dan Geiger:
A sufficiently fast algorithm for finding close to optimal junction trees. UAI 1996: 81-89

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.