Perfect Elimination Orderings for Symmetric Matrices

Monique Laurent, Shin-ichi Tanigawa

Research output: Working paperOther research output


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.
Original languageEnglish
Place of PublicationIthaca
PublisherCornell University Library
Number of pages17
Publication statusPublished - 17 Apr 2017

Publication series



  • Chordal graph
  • Perfect elimination ordering
  • Unit interval
  • Ultrametric
  • Shortest path metric
  • Robinson matrix

Fingerprint Dive into the research topics of 'Perfect Elimination Orderings for Symmetric Matrices'. Together they form a unique fingerprint.

  • Research Output

    Perfect elimination orderings for symmetric matrices

    Laurent, M. & Tanigawa, S., 2020, In : Optimization Letters. 14, 2, p. 339-353

    Research output: Contribution to journalArticleScientificpeer-review

    Open Access
  • Cite this

    Laurent, M., & Tanigawa, S. (2017). Perfect Elimination Orderings for Symmetric Matrices. (arXiv; Vol. 1706.05115). Cornell University Library.