Anzeige
Erschienen in:
1995 | ReviewPaper | Buchkapitel
GLB-closures in directed acyclic graphs and their applications
verfasst von : Volker Turau, Weimin Chen
Erschienen in: Graph-Theoretic Concepts in Computer Science
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.