Exposés de recherche

Collection Exposés de recherche

00:00:00 / 00:00:00
276 380

Combinatorial and algorithmic properties of Robinsonian matrices

By Monique Laurent

Also appears in collection : IX Latin and American algorithms, graphs and optimization symposium (LAGOS 2017) / 9e symposium latino et americain des algorithmes, graphes et de l'optimisation (LAGOS 2017)

Robinsonian matrices are structured matrices that have been introduced in the 1950's by the archeologist W.S. Robinson for chronological dating of Egyptian graves. A symmetric matrix is said to be Robinsonian if its rows and columns can be simultaneously reordered in such a way that the entries are monotone nondecreasing in the rows and columns when moving toward the main diagonal. Robinsonian matrices can be seen as a matrix analog of unit interval graphs, which are precisely the graphs having a Robinsonian adjacency matrix. We will discuss several aspects of Robinsonian matrices: links to unit interval graphs; new efficient combinatorial recognition algorithm based on Similarity-First Search, a natural extension to weighted graphs of Lex-BFS; structural characterization by minimal forbidden substructures; and application to tractable instances of the Quadratic Assignment Problem.

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.19221503
  • Cite this video Laurent, Monique (12/09/2017). Combinatorial and algorithmic properties of Robinsonian matrices. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19221503
  • URL https://dx.doi.org/10.24350/CIRM.V.19221503

Bibliography

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback