acyclic digraph

noun

(graph theory, computer science) A directed acyclic graph, a finite directed graph that contains no directed cycles.

An acyclic digraph is a directed graph without any cycles.

Google翻訳 / DeepL翻訳

詳細

意味（1）

(graph theory, computer science) A directed acyclic graph, a finite directed graph that contains no directed cycles.

In the study of the competition graph of an acyclic digraph, there are two fundamental questions which were proposed by Roberts in 1978: One is to characterize the acyclic digraphs that have interval competition graphs and the other is to characterize the graphs which are competition graphs of acyclic digraphs.

Google翻訳 / DeepL翻訳

詳細

acyclic digraph

Dictionary quizzes to help you remember the meaning

ログイン / 新規登録

アプリをダウンロード！

acyclic digraph

Dictionary quizzes to help you remember the meaning

ログイン / 新規登録

ログイン

──── or ────

新規登録

──── or ────

アプリをダウンロード！