Dynamic programming, tree-width and computation on graphical models

Authors:
Stuart Geman;Brian Oliveira Lucena
Affiliations:
-;-
Venue:
Dynamic programming, tree-width and computation on graphical models
Year:
2002

Citing 0
Cited 4

Achievable sets, brambles, and sparse treewidth obstructions

Discrete Applied Mathematics
On the maximum cardinality search lower bound for treewidth

Discrete Applied Mathematics
A rate and history-preserving resampling algorithm for neural spike trains

Neural Computation
Treewidth computations II. Lower bounds

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract