Improved efficient parallel algorithms to recognize interval graphs and interval hypergraphs

Author

Dahlhaus, Elias

Author_Institution

Dept. of Comput. Sci., Bonn Univ., Germany

Volume

1

fYear

1997

fDate

7-10 Jan 1997

Firstpage

172

Abstract

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

Keywords

graph theory; parallel algorithms; pattern recognition; P-Q-trees; convex bipartite graph recognition; hyperedges; interval graph recognition; interval hypergraph recognition; lexical breadth-first search procedure; ordered vertices; parallel algorithms; subtree representation; Bipartite graph; Data structures; Information retrieval; Parallel algorithms; Tree graphs;

fLanguage

English

Publisher

ieee

Conference_Titel

System Sciences, 1997, Proceedings of the Thirtieth Hawaii International Conference on

Conference_Location

Wailea, HI

ISSN

1060-3425

Print_ISBN

0-8186-7743-0

Type

conf

DOI

10.1109/HICSS.1997.667212

Filename

667212