By Topic

Improved efficient parallel algorithms to recognize interval graphs and interval hypergraphs

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

1 Author(s)
Dahlhaus, E. ; Dept. of Comput. Sci., Bonn Univ., Germany

Presents simple parallel algorithms to recognize hypergraphs with the property that the vertices can be ordered so that the hyperedges form intervals. The algorithm circumvents P-Q-trees and is a simplification of the algorithm of Klein and Reif (1988). This results in a simple parallel algorithm for interval graph recognition and for the recognition of convex bipartite graphs. The basic ideas are quite similar to the interval graph recognition algorithm of Hsu (1992). The major idea is that we can circumvent the lexical breadth-first search procedure. With similar techniques, interval hypergraphs can also be recognized. They can be recognized with a slightly smaller workload if a representation of the hyperedges as subtrees is known

Published in:

System Sciences, 1997, Proceedings of the Thirtieth Hawaii International Conference on  (Volume:1 )

Date of Conference:

7-10 Jan 1997