directed acyclic graph

英語

Noun

directed acyclic graph (複數 directed acyclic graphs)

1. (圖論，計算機科學) 有向無環圖

   近義詞： acyclic digraph、acyclic directed graph、(acronym) DAG

   下位詞： Bayesian network、tree

   • 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.

   • 2001, Peter J. Pahl, Rudolf Damrath, Mathematical Foundations of Computational Engineering: A Handbook, Springer, page 574,

     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=(V;R)$ is asymmetric and does not contain 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.

延伸閱讀

• Bayesian network在英語維基百科上的資料。維基百科 ^en
• Acyclic Digraph on Wolfram MathWorld