Dictionary

directed acyclic graph en · NOUN

Meanings

1. A finite directed graph that contains no directed cycles.
   • 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, LNAI 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, LNCS 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. […] Directed acyclic graphs are widely used in different areas of computer science.
   • In studying these properties, a distinction is made between directed acyclic graphs with directed edges and simple acyclic graphs with undirected edges.[…]A directed acyclic graph G#61;(V#59;R) is asymmetric and does not contain cycles. 2001, Peter J. Pahl, Rudolf Damrath, Mathematical Foundations of Computational Engineering: A Handbook, Springer, page 574:

Forms

Synonyms

acyclic digraph · acyclic directed graph · DAG

Translations (7)

pl skierowany graf acykliczny (directed graph without cycles) · it grafo aciclico diretto (directed graph without cycles) · it digrafo aciclico (directed graph without cycles) · bg ориентиран ацикличен граф (directed graph without cycles) · cs orientovaný acyklický graf (directed graph without cycles) · de gerichteter azyklischer Graph (directed graph without cycles) · it grafo aciclico orientato (directed graph without cycles)