Similarity-first search: A new algorithm with application to Robinsonian matrix recognition
Laurent,Monique Seminaroti,Matteo
Laurent,Monique
Seminaroti,Matteo
Abstract
We present a new efficient combinatorial algorithm for recognizing if a given symmetric matrix is Robinsonian, i.e., if its rows and columns can be simultaneously reordered so that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. As the main ingredient we introduce a new algorithm, named Similarity-First Search (SFS), which extends lexicographic breadth-first search (Lex-BFS) to weighted graphs and which we use in a multisweep algorithm to recognize Robinsonian matrices. Since Robinsonian binary matrices correspond to unit interval graphs, our algorithm can be seen as a generalization to weighted graphs of the 3-sweep Lex-BFS algorithm of Corneil for recognizing unit interval graphs. This new recognition algorithm is extremely simple and it exploits new insight on the combinatorial structure of Robinsonian matrices. For an $n\times n$ nonnegative matrix with $m$ nonzero entries, it terminates in $n-1$ SFS sweeps, with overall running time $O(n^2 +nm\log n)$. Read More: http://epubs.siam.org/doi/abs/10.1137/16M1056791
Description
Date
2017
Journal Title
Journal ISSN
Volume Title
Publisher
Research Projects
Organizational Units
Journal Issue
Keywords
Robinson (dis)similarity, seriation, similarity search, Lex-BFS, LBFS, partition refinement
Citation
Laurent, M & Seminaroti, M 2017, 'Similarity-first search : A new algorithm with application to Robinsonian matrix recognition', SIAM Journal on Discrete Mathematics, vol. 31, no. 3, pp. 1765–1800. https://doi.org/10.1137/16M1056791
License
info:eu-repo/semantics/closedAccess