摘要: We investigate strongly decomposable graphs, a special class of triangulated graphs with marked vertices. In statistics, vertices represent models for multivariate data, where some variables are qualitative and quantitative. Strongly correspond to models, which admit simple interpretation solution the estimation problems. show that graph G is if only suitably denned modification triangulated. This result allows an easy generalization characterizations, properties algorithms graphs.
sci-hub.se 参考文章(8)
S. L. Lauritzen, T. P. Speed, K. Vijayan, Decomposable graphs and hypergraphs Journal of The Australian Mathematical Society. ,vol. 36, pp. 12- 29 ,(1984) , 10.1017/S1446788700027300
Robert E. Tarjan, Mihalis Yannakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs SIAM Journal on Computing. ,vol. 13, pp. 566- 579 ,(1984) , 10.1137/0213035
G. A. Dirac, On rigid circuit graphs Abhandlungen Aus Dem Mathematischen Seminar Der Universitat Hamburg. ,vol. 25, pp. 71- 76 ,(1961) , 10.1007/BF02992776
Donald J Rose, Triangulated graphs and the elimination process Journal of Mathematical Analysis and Applications. ,vol. 32, pp. 597- 609 ,(1970) , 10.1016/0022-247X(70)90282-9
S. L. Lauritzen, N. Wermuth, Graphical Models for Associations between Variables, some of which are Qualitative and some Quantitative Annals of Statistics. ,vol. 17, pp. 31- 57 ,(1989) , 10.1214/AOS/1176347003
Donald J. Rose, R. Endre Tarjan, George S. Lueker, Algorithmic Aspects of Vertex Elimination on Graphs SIAM Journal on Computing. ,vol. 5, pp. 266- 283 ,(1976) , 10.1137/0205021
Delbert Fulkerson, Oliver Gross, Incidence matrices and interval graphs Pacific Journal of Mathematics. ,vol. 15, pp. 835- 855 ,(1965) , 10.2140/PJM.1965.15.835
Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis, On the Desirability of Acyclic Database Schemes Journal of the ACM. ,vol. 30, pp. 479- 513 ,(1983) , 10.1145/2402.322389