Properties of markovian subgraphs of a decomposable graph
MICAI 2006: Advances in Artificial Intelligence, Proceedings（2006）
摘要
We explore the properties of subgraphs (called Markovian subgraphs) of a decomposable graph under some conditions. For a decomposable graph and a collection γ of its Markovian subgraphs, we show that the set of the intersections of all the neighboring cliques of contains . We also show that holds for a certain type of which we call a maximal Markovian supergraph of γ. This graph-theoretic result is instrumental for combining knowledge structures that are given in undirected graphs.
更多查看译文
关键词
markovian subgraphs,neighboring clique,graph-theoretic result,decomposable graph,undirected graph,certain type,knowledge structure,maximal markovian supergraph
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要