A Lex-BFS-Based Recognition Algorithm for Robinsonian Matrices
نویسندگان
چکیده
Robinsonian matrices arise in the classical seriation problem and play an important role in many applications where unsorted similarity (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-first 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.
منابع مشابه
Similarity-First Search: a new algorithm with application to Robinsonian matrix recognition
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 main ingredient we introduce a new algorithm, named Similarity-First-Search (SFS), which extends Lexicographic BreadthFirst S...
متن کاملLex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
By making use of lexicographic breadth rst search (Lex-BFS) and partition re nement with pivots, we obtain very simple algorithms for some well-known problems in graph theory. We give a O(n + m log n) algorithm for transitive orientation of a comparability graph, and simple linear algorithms to recognize interval graphs, convex graphs, Y -semichordal graphs and matrices that have the consecutiv...
متن کاملMaximum Cardinality Search for Computing Minimal Triangulations
We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: Lex-M and MCS. Lex-M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that also computes a minimal triangulation of an arbitrary graph. MCS simplified the fundamental c...
متن کاملA Structural Characterization for Certifying Robinsonian Matrices
A symmetric matrix is Robinsonian if its rows and columns can be simultaneously reordered in such a way that entries are monotone nondecreasing in rows and columns when moving toward the diagonal. The adjacency matrix of a graph is Robinsonian precisely when the graph is a unit interval graph, so that Robinsonian matrices form a matrix analogue of the class of unit interval graphs. Here we prov...
متن کاملEnumerating Global States of a Distributed Computation
Global predicate detection is a fundamental problem in distributed computing in the areas of distributed debugging and software fault-tolerance. It requires searching the global state lattice of a computation to determine if any consistent global state satisfies the given predicate. We give an efficient algorithm that perform the lex traversal of the lattice. We also give a space efficient algo...
متن کامل