Tarjan, Robert E.; Yannakakis, Mihalis Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. (English) Zbl 0545.68062 SIAM J. Comput. 13, 566-579 (1984). Cited in 3 ReviewsCited in 253 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 65F05 Direct numerical methods for linear systems and matrix inversion 68P20 Information storage and retrieval of data 65F50 Computational methods for sparse matrices 05C65 Hypergraphs Keywords:graph algorithm; acyclic data base scheme; sparse Gaussian elimination; graph search; Chordal graphs; acyclic hypergraphs Citations:Zbl 0353.65019 PDF BibTeX XML Cite \textit{R. E. Tarjan} and \textit{M. Yannakakis}, SIAM J. Comput. 13, 566--579 (1984; Zbl 0545.68062) Full Text: DOI OpenURL