Junction trees of general graphs

Frontiers of Mathematics in China

Volumn 3, Issue 3, 2008, Pages 399-413

  Wang, Xiaofei ^a   Guo, Jianhua ^a  

^a NORTHEAST NORMAL UNIVERSITY   (China)

Author keywords

Junction property; Junction tree; P decomposition; Running intersection property

Indexed keywords

EID: 47249121260     PISSN: 16733452     EISSN: 16733576     Source Type: Journal    
DOI: 10.1007/s11464-008-0023-z     Document Type: Article

References (12)

1. Berry A, Bordat J P. Separability generalizes Dirac's theorem. Discrete Applied Mathematics, 1998, 84: 43-53
2. Blair J R S, Peyton B W. An introduction to chordal graphs and clique trees. In: George J A, Liu J W H, Eds. Sparse Matrix Computations: Graph Theory Issues and Algorithms, IMA Volumes in Mathematics and Its Applications, Vol 56. Berlin: Springer-Verlag, 1993, 1-30
3. Buneman P. A characterization of rigid circuit graphs. Discrete Math, 1974, 9: 205-212
4. Darroch J N, Lauritzen S L, Speed T P. Markov fields and log-linear interaction models for contingency tables. Ann Statist, 1980, 8: 522-539
5. Diestel R. Graph Decomposition-A Study in Infinite Graph Theory. Oxford: Clarendon Press, 1990
6. Dirac G A. On rigid circuit graphs. Abh Math Sem Univ Hamburg, 1961, 25: 71-76
7. Gavril F. The intersection graphs of subtrees in trees are exactly the chordal graphs. J Combin Theory, Ser B, 1974, 16: 47-56
8. Leimer H G. Optimal decomposition by clique separators. Discrete Math, 1993, 113: 99-123
9. Lekkerkerker C G, Boland J C. Representation of a finite graph by a set of intervals on the real line. Fund Math Polska Akad Nauk, 1962, 51: 45-64
10. Tarjan R E. Decomposition by clique separators. Discrete Math, 1985, 55: 221-232
11. Walter J. Representations of rigid cycle graphs. Dissertation for the Doctoral Degree. Detroit: Wayne State University, 1972
12. Xu P F, Guo J H. Optimal triangulation of Bayesian networks by decomposition. Technical Report KLAS#07-003. Changchun: Northeast Normal University, 2007