Elsevier

Journal of Algorithms

Volume 12, Issue 1, March 1991, Pages 96-109
Journal of Algorithms

Parallel algorithms for parity graphs

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

Abstract

A graph is called a parity graph iff for every pair of vertices all minimal chains joining them have the same parity. We study properties of parity graphs from the point of view of parallel algorithms. We present a parallel algorithm to recognize parity graphs which runs in O(log2 n) time with n4log2 n processors on a CREW PRAM computer and a parallel algorithm for finding the size of a maximum clique which runs in O(log2 n) time with n3log2 n processors. The method which is used to find a maximum clique leads also to a simple O(n2) sequential algorithm.

References (10)

There are more references available in the full text version of this article.

Cited by (6)

  • On the extension of bipartite to parity graphs

    1999, Discrete Applied Mathematics
  • An optimal parallel matching algorithm for cographs

    1994, Journal of Parallel and Distributed Computing
  • A new characterization for parity graphs and a coloring problem with costs

    1998, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
  • On the equivalence in complexity among basic problems on bipartite and parity graphs

    1997, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
  • An efficient parallel recognition algorithm of parity graphs

    1993, Proceedings - ICCI 1993: 5th International Conference on Computing and Information
View full text