By Topic

Parallel maximum matching algorithms in interval graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yoojin Chung ; Dept. of Comput. Eng., Seoul Nat. Univ., South Korea ; Kunsoo Park ; Yookun Cho

We develop new parallel maximum matching algorithms in interval graphs by exploiting the characteristics of interval graphs. For general interval graphs, our algorithm requires O(log2 v+(n log n)/v) time and O(nv2+n2) operations on the CREW PRAM, where n is the number of intervals and v⩽n is a parameter. By choosing v=√n, we obtain an O(√n log n)-time algorithm in O(n2) operations. For v=n/log n, we have an O(log2 n)-time algorithm with n3/log4 n processors. The previously best known solution takes O(log2 n) time with n 3 processors. For proper interval graphs, our algorithm runs in O(log n) time using n/log n processors if input intervals are sorted and using n processors otherwise on the EREW PRAM. Our algorithms are much simpler than the previous ones

Published in:

Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on

Date of Conference:

10-13 Dec 1997