By Topic

Parallel maximal cliques algorithms for interval graphs with applications

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

2 Author(s)
Chi Su Wang ; Dept. of Inf. Manage., Nat. Taiwan Inst. of Technol., Taipei, Taiwan ; Ruay Shiung Chang

In this paper, an O(n log n) time algorithm for finding all the maximal cliques of an interval graph is proposed. This algorithm can also be implemented in parallel in O(log n) time using O(n2) processors. The maximal cliques of an interval graph contain important structural information. Many problems on interval graphs can be solved after all the maximal cliques are known. It is shown that cut vertices, bridges, and vertex connectivities can all be determined easily after the maximal cliques are known. Finally, the all-pair shortest path problem for interval graphs is solved based on the relationship between maximal cliques. The all-pair shortest path algorithm can also be parallelized in O(log n) time using O(n2) processors

Published in:

Parallel Architectures, Algorithms and Networks, 1994. (ISPAN), International Symposium on

Date of Conference:

14-16 Dec 1994