메뉴 건너뛰기




Volumn 32, Issue 1, 2002, Pages 21-31

Maximal prime subgraph decomposition of bayesian networks

Author keywords

Bayesian networks; Divide and conquer triangulation; Graph decomposition; Hybrid propagation; Incremental compilation; Junction tree representation; LAZY propagation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MARKOV PROCESSES; SET THEORY; THEOREM PROVING;

EID: 0036465639     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/3477.979956     Document Type: Article
Times cited : (61)

References (19)
  • 6
    • 4243996844 scopus 로고    scopus 로고
    • Decomposition of graphs and hypergraphs with identification of conformal hypergraphs
    • Dept. Computer Science, Aalborg Univ., Aalborg, Denmark, Tech. Rep. R-96-2032
    • (1996)
    • Badsberg, J.H.1
  • 8
    • 0343360322 scopus 로고
    • Aspects of efficiency improvement in Bayesian networks
    • Ph.D. dissertation, Dept. Computer Science, Aalborg Univ., Aalborg, Denmark, Apr.
    • (1993)
    • Kjærulff, U.1
  • 11
    • 0021473698 scopus 로고
    • Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
    • (1984) SIAM J. Comput. , vol.13 , Issue.3 , pp. 566-579
    • Tarjan, R.E.1    Yannakakis, M.2
  • 13


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.