Skip to main content
Log in

Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

Given a set of n intervals representing an interval graph, the problem of finding a maximum matching between pairs of disjoint (nonintersecting) intervals has been considered in the sequential model. In this paper we present parallel algorithms for computing maximum cardinality matchings among pairs of disjoint intervals in interval graphs in the EREW PRAM and hypercube models. For the general case of the problem, our algorithms compute a maximum matching in O( log 3 n) time using O(n/ log2 n) processors on the EREW PRAM and using n processors on the hypercubes. For the case of proper interval graphs, our algorithm runs in O( log n ) time using O(n) processors if the input intervals are not given already sorted and using O(n/ log n ) processors otherwise, on the EREW PRAM. On n -processor hypercubes, our algorithm for the proper interval case takes O( log n log log n ) time for unsorted input and O( log n ) time for sorted input. Our parallel results also lead to optimal sequential algorithms for computing maximum matchings among disjoint intervals. In addition, we present an improved parallel algorithm for maximum matching between overlapping intervals in proper interval graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received November 20, 1995; revised September 3, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andrews, M., Atallah, M., Chen, D. et al. Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems . Algorithmica 26, 263–289 (2000). https://doi.org/10.1007/s004539910013

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004539910013

Navigation