Robinsonian Matrices: Recognition Challenges
- 109 Downloads
Ultrametric inequality is involved in different operations on (dis)similarity matrices. Its coupling with a compatible ordering leads to nice interpretations in seriation problems. We accurately review the interval graph recognition problem for its tight connection with recognizing a dense Robinsonian dissimilarity (precisely, in the anti-ultrametric case). Since real life matrices are prone to errors or missing entries, we address the sparse case and make progress towards recognizing sparse Robinsonian dissimilarities with lexicographic breadth first search. The ultrametric inequality is considered from the same graph point of view and the intimate connection between cocomparability graph and dense Robinsonian similarity is established. The current trend in recognizing special graph structures is examined in regard to multiple lexicographic search sweeps. Teaching examples illustrate the issues addressed for both dense and sparse symmetric matrices.
KeywordsRobinsonian matrices Interval graphs Cocomparability graphs Lexicographic searches Partition refinement
Unable to display preview. Download preview PDF.
- KÖHLER, E., and MOUATADID, L. (2014), “Linear Time LexDFS on Cocomparability Graphs”, in Algorithm Theory—SWAT 2014, Vol. 8503, Lecture Notes in Computer Science, Springer, pp. 319–330.Google Scholar
- LAURENT, M., and SEMINAROTI, M. (2015a), A Lex-BFS-Based Recognition Algorithm for Robinsonian Matrices, Springer International Publishing, pp. 325–338.Google Scholar
- LAURENT, M., and SEMINAROTI, M. (2016), “Similarity-First Search: A New Algorithm with Application To RobinsonianMatrix Recognition”, CoRR, abs/1601.03521, http://arxiv.org/abs/1601.03521.
- MCCONNELL, R.M., and SPINRAD, J.P. (1994), “Linear-Time Modular Decomposition and Efficient Transitive Orientation of Comparability Graphs”, in Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Arlington, VA, 1994), New York: ACM, pp. 536–545.Google Scholar