Abstract
A subset S of the vertices of a directed acyclic graph is called glb-closed, if it contains the greatest lower bounds of all pairs of vertices of S. The glb-closure of S is the smallest glb-closed subset containing S. An efficient output sensitive algorithm for computing glb-closures is presented and two applications in the field of object-oriented programming languages are discussed.
This work was done while the author was visiting the International Computer Science Institute in Berkeley.
Preview
Unable to display preview. Download preview PDF.
References
Aït-Kaci, H., Boyer, R., Lincoln, P., and Nasr, R. Efficient Implementation of Lattice Operations. ACM Trans. on Prog. Lang. and Syst. Vol. 11. No. 1, January 1989, 115–146.
Agrawal, R., Borgida, A., and Jagadish, H.V. Efficient Management of Transitive Relationships in Large Data and Knowledge Bases. Proc. ACM-SIGMOD Int'l Conf. on Management of Data, 1989.
Agrawal, R., DeMichiel, L. G., and Lindsay, B. G. Static Type Checking of Multi-Methods. Proc. Conf. on Object-Oriented Prog. Sys., Lang., 1991.
André, P., and Royer, J.-C. Optimizing Method Search with Lookup Caches and Incremental Coloring. In Proc. Conf. on Object-Oriented Prog. Sys., Lang., 1992.
Bobrow, D. G., Kahn, K., Kiczales, G., Masinter, L., Stefik, M., and Zdybel, F. CommonLoops: Merging Lisp and Object-Oriented Programming. In Proc. Conf. on Object-Oriented Prog. Sys., Lang., 1986.
Bobrow, D. G., DeMichiel, L. G., Gabriel, R. P., Keene, S. E., Kiczales, G., and Moon, D. A. Common Lisp Object System Specification X3J13. In SIGPLAN Notice 23, special issue, Sept. 1988.
Chen, W., Turau, V., and Klas, W. Efficient Dynamic Look-up Strategy for Multi-Methods. Proc. European Conf. on Object-Oriented Prog., Bologna, 1994.
Ducournau, R., Habib, M., Huchard, M., and Mugnier, M. L. Monotonie Conflict Resolution Mechanisms for Inheritance. In Proc. Conf. on Object-Oriented Prog. Sys., Lang., and Appl., 1992, 16–24.
Karel, D. Selector Table Indexing & Sparse Arrays. In Proc. Conf. on Object-Oriented Prog. Syst., Lang., 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Turau, V., Chen, W. (1995). GLB-closures in directed acyclic graphs and their applications. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1994. Lecture Notes in Computer Science, vol 903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59071-4_42
Download citation
DOI: https://doi.org/10.1007/3-540-59071-4_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59071-2
Online ISBN: 978-3-540-49183-5
eBook Packages: Springer Book Archive