Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
暂无分享,去创建一个
[1] G. Dirac. On rigid circuit graphs , 1961 .
[2] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .
[3] D. Rose. Triangulated graphs and the elimination process , 1970 .
[4] Fred G. Gustavson,et al. Some Basic Techniques for Solving Sparse Systems of Linear Equations , 1972 .
[5] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..
[6] Ronald Fagin,et al. A simplied universal relation assumption and its properties , 1982, TODS.
[7] David Maier,et al. Connections in Acyclic Hypergraphs , 1984, Theor. Comput. Sci..