PREPROCESSING RULES FOR TRIANGULATION OF PROBABILISTIC NETWORKS*
- 1 August 2005
- journal article
- Published by Wiley in Computational Intelligence
- Vol. 21 (3) , 286-305
Abstract
No abstract availableKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- A partial k-arboretum of graphs with bounded treewidthTheoretical Computer Science, 1998
- On Linear Recognition of Tree-Width at Most FourSIAM Journal on Discrete Mathematics, 1996
- The nonexistence of reduction rules giving an embedding into a k-treeDiscrete Applied Mathematics, 1994
- An algebraic theory of graph reductionJournal of the ACM, 1993
- Algorithms finding tree-decompositions of graphsJournal of Algorithms, 1991
- Local Computations with Probabilities on Graphical Structures and Their Application to Expert SystemsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1988
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986