eCommons

 

Generalized $PQ$-trees

Other Titles

Abstract

We introduce a new data structure, which we call generalized PQ-trees because they behave like Booth and Lueker's PQ-trees. Given a ground set of n elements S, and A={A1,…,Ak} a collection of subsets of S, generalized PQ-trees allow us to efficiently represent which subsets of S never partially overlap with sets in A. We give an O(kn) time sequential algorithm and an O(kn) processor parallel algorithm for computing the generalized PQ-tree. Our new data structure can be used to speed up other researchers algorithms for recognizing interval and parity graphs.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1989-12

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-1074

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record