A Lex-BFS-based recognition algorithm for Robinsonian matrices
Laurent,Monique Seminaroti,M.
Laurent,Monique
Seminaroti,M.
Abstract
Robinsonian matrices arise in the classical seriation problem and play an important role in many applications where unsorted sim- ilarity (or dissimilarity) information must be reordered. We present a new polynomial time algorithm to recognize Robinsonian matrices based on a new characterization of Robinsonian matrices in terms of straight enumerations of unit interval graphs. The algorithm is simple and is based essentially on lexicographic breadth-rst search (Lex-BFS), using a divide-and-conquer strategy. When applied to a nonnegative symmetric n n matrix with m nonzero entries and given as a weighted adjacency list, it runs in O(d(n + m)) time, where d is the depth of the recursion tree, which is at most the number of distinct nonzero entries of A.
Description
Date
2015
Journal Title
Journal ISSN
Volume Title
Publisher
Springer Verlag
Research Projects
Organizational Units
Journal Issue
Keywords
Robinson (dis)similarity unit interval graph Lex-BFS seriation partition renement straight enumeration, unit interval graph, Lex-BFS, seriation, partition renement, straight enumeration
Citation
Laurent, M & Seminaroti, M 2015, A Lex-BFS-based recognition algorithm for Robinsonian matrices. in P Vangelis & P Widmayer (eds), Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC 2015). 2015 edn, vol. 9079, Springer Verlag, pp. 325-338, 9th Conference on on Algorithms and Complexity, Paris, France, 20/05/15. https://doi.org/10.1007/978-3-319-18173-8
License
info:eu-repo/semantics/restrictedAccess