Directed acyclic graph
Jump to navigation
Jump to search
English
Noun
- Template:Lb A finite directed graph that contains no directed cycles.
- 1995, Volker Turan, Weimin Chen, GLB-closures in Directed Acyclic Graphs and Their Applications, Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer (editors), Graph-Theoretic Concepts in Computer Science: 20th International Workshop, Proceedings, Springer, Template:W 903, page 121,
- 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.Template:...Directed acyclic graphs are widely used in different areas of computer science.
- Template:Quote-book
- 2011, Michael Donders, Sara Miner More, Pavel Naumov, Information Flow on Directed Acyclic Graphs, Lev D. Beklemishev, Ruy de Queiroz (editors), Logic, Language, Information, and Computation: 18th International Workshop, Proceedings, Springer, Template:W 6642, page 95,
- A logical system that describes the properties of this relation for an arbitrary fixed directed acyclic graph is introduced and proven to be complete and decidable.
- 1995, Volker Turan, Weimin Chen, GLB-closures in Directed Acyclic Graphs and Their Applications, Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer (editors), Graph-Theoretic Concepts in Computer Science: 20th International Workshop, Proceedings, Springer, Template:W 903, page 121,
Translations
- Czech: Template:T
- German: Template:T
- Italian: Template:T, Template:T, Template:T