Referenced Items are not available for this document.
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
- Page(s):
- 172 - 181 vol.1
- Meeting Date :
- 07 Jan 1997-10 Jan 1997
- ISSN :
- 1060-3425
- Print ISBN:
- 0-8186-7743-0
- INSPEC Accession Number:
- 5907164
- Conference Location :
- Wailea, HI
- Digital Object Identifier :
- 10.1109/HICSS.1997.667212
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
