Elsevier

Journal of Algorithms

Volume 12, Issue 3, September 1991, Pages 375-392
Journal of Algorithms

Parallel recognition of the consecutive ones property with applications

https://doi.org/10.1016/0196-6774(91)90010-VGet rights and content

Abstract

Given a (0, 1)-matrix, the problem of recognizing the consecutive 1's property for rows is to decide whether it is possible to permute the columns such that the resulting matrix has the consecutive 1's in each of its rows. In this paper, we give the first NC algorithm for this problem. The algorithm runs in O(log n + log2 m) time using O(m2n + m3) processors on Common CRCW PRAM, where m × n is the size of the matrix. The algorithm can be extended to detect the circular 1's property within the same resource bounds. We can also make use of the algorithm to recognize convex bipartite graphs in O(log2 n) time using O(n3) processors, where n is the number of vertices in a graph. We further show that the maximum matching problem for arbitrary convex bipartite graphs can be solved within the same complexity bounds, combining the work by Dekel and Sahni, who gave an efficient parallel algorithm for computing maximum matchings in convex bipartite graphs with the condition that the neighbors of each vertex in one vertex set of a bipartite graph occur consecutively in the other vertex set. This broadens the class of graphs for which the maximum matching problem is known to be in NC.

References (24)

  • D.R Fulkerson et al.

    Incidence matrices and interval groups

    Pacific J. Math.

    (1965)
  • Z Galil

    Efficient algorithms for finding maximum matching in graphs

    Comput. Surveys

    (1986)
  • Cited by (22)

    • Circular-arc hypergraphs: Rigidity via connectedness

      2017, Discrete Applied Mathematics
      Citation Excerpt :

      Note also that Theorem 1.1 is a consequence of Part 2. The proof of each part follows the same scheme, used by Chen and Yesha [4, Theorem 2] for overlap-connected interval hypergraphs. Moreover, the claims about interval hypergraphs easily follow from the analogous claims about CA hypergraphs.

    • Solving the canonical representation and Star System Problems for proper circular-arc graphs in logspace

      2016, Journal of Discrete Algorithms
      Citation Excerpt :

      For the latter class we have linear-time algorithms for recognition [4] and canonical representation [29] due to the seminal work by Booth and Lueker; logspace algorithms for these tasks are designed in [21]. The aforementioned circular ones property and the related consecutive ones property (requiring that the columns can be permuted so that the 1-entries in each row form a segment) were studied in [4,17,18], where linear-time algorithms are given; parallel AC2 algorithms were suggested in [9,2]. In order to solve the canonical representation problem for CA hypergraphs we have to compute for a given hypergraph some arc representation (if it exists) such that isomorphic CA hypergraphs obtain identical arc models.

    • On the isomorphism problem for Helly circular-arc graphs

      2016, Information and Computation
      Citation Excerpt :

      The latter relation is excluded in interval systems. The following fact about interval systems is due to [3, Theorem 2]; see also [11, Section 2.2]. We are now prepared to prove Theorem 1.1.

    • Optimal computation of shortest paths on doubly convex bipartite graphs

      1999, Computers and Mathematics with Applications
    View all citing articles on Scopus

    Supported in part by the Office of Research and Graduate Studies of Ohio State University.

    Supported in part by the National Science Foundation under Grant DCR-8606366 at Ohio State University.

    View full text