Efficient subtyping tests with PQ-encoding
Authors:
Open Access
- 1 October 2001
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 36 (11) , 96-107
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- A note on computing a maximal planar subgraph using PQ-treesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1998
- On-line maintenance of triconnected components with SPQR-treesAlgorithmica, 1996
- Sparse term encoding for dynamic taxonomiesLecture Notes in Computer Science, 1996
- Representation of an order as union of interval orders1994
- Efficient handling of multiple inheritance hierarchiesACM SIGPLAN Notices, 1993
- Type-extension type test can be performed in constant timeACM Transactions on Programming Languages and Systems, 1991
- On-line graph algorithms with SPQR-trees1990
- Efficient implementation of lattice operationsACM Transactions on Programming Languages and Systems, 1989
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Recursive ProgrammingNumerische Mathematik, 1960