Models for Graph Decomposition
Lists
Only you see this
Abstract
We consider in this chapter three models of graph decomposition: elimination orders, jointrees and dtrees, which underly the key inference algorithms we discussed thus far. We present formal definitions of these models, provide polytime, width-preserving transformations between them, and show how the optimal construction of each of these models corresponds in a precise sense to the process of optimally triangulating a graph.
BibTeX
@inproceedings{darwiche2009models,
author = {Adnan Darwiche},
title = {{Models for Graph Decomposition}},
booktitle = {Cambridge},
year = {2009},
doi = {10.1017/cbo9780511811357.010},
}Loading related content...