Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376)

DOI10.1137/S0895480104445010zbMath1105.05066MaRDI QIDQ5470799

Pinar Heggernes, Jan Arne Telle, Yngve Villanger

Publication date: 1 June 2006

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chordal graph; matrix multiplication; minimal fill

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C85: Graph algorithms (graph-theoretic aspects)