We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of monotone families of chordal graphs, Robinsonian matrices and ultrametrics. We give a structural characterization for matrices that admit perfect elimination orderings in terms of forbidden substructures generalizing chordless cycles in graphs.
CITATION STYLE
Laurent, M., & Tanigawa, S. ichi. (2020). Perfect elimination orderings for symmetric matrices. Optimization Letters, 14(2), 339–353. https://doi.org/10.1007/s11590-017-1213-y
Mendeley helps you to discover research relevant for your work.