Junction trees of general graphs

DOI10.1007/s11464-008-0023-zzbMath1168.05306OpenAlexW1986191436MaRDI QIDQ2519354

Xiao-Fei Wang, Jian-hua Guo

Publication date: 26 January 2009

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-008-0023-z

zbMATH Keywords

junction treejunction propertyp-decompositionrunning-intersection property

Mathematics Subject Classification ID

Trees (05C05) Characterization and structure theory for multivariate probability distributions; copulas (62H05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Contingency tables (62H17)

Related Items (1)

Finding the minimal set for collapsible graphical models

Cites Work

• On rigid circuit graphs
• Decomposition by clique separators
• Markov fields and log-linear interaction models for contingency tables
• Separability generalizes Dirac's theorem
• A characterisation of rigid circuit graphs
• Optimal decomposition by clique separators
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representation of a finite graph by a set of intervals on the real line
• Unnamed Item
• Unnamed Item

This page was built for publication: Junction trees of general graphs