"acyclic digraph" meaning in All languages combined

{
  "categories": [
    {
      "kind": "other",
      "name": "有1個詞條的頁面",
      "parents": [],
      "source": "w"
    },
    {
      "kind": "other",
      "name": "有詞條的頁面",
      "parents": [],
      "source": "w"
    },
    {
      "kind": "other",
      "name": "英語可數名詞",
      "parents": [],
      "source": "w"
    },
    {
      "kind": "other",
      "name": "英語名詞",
      "parents": [],
      "source": "w"
    },
    {
      "kind": "other",
      "name": "英語詞元",
      "parents": [],
      "source": "w"
    }
  ],
  "forms": [
    {
      "form": "acyclic digraphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "lang": "英語",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "英語 圖論",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "英語 計算機科學",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1993, Suh-Ryung-Kim, The Competition Number and Its Variants, J. Gimbel, J.W. Kennedy, L.V. Quintas (editors), Quo Vadis, Graph Theory?: A Source Book for Challenges and Directions, Elsevier (North-Holland), page 313,",
          "text": "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."
        },
        {
          "ref": "2009, Tamara Mchedlidze, Antonios Symvonis, Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs, Hung Q. Ngo (editor), Computing and Combinatorics: 15th Annual International Conference, Proceedings, Springer, LNCS 5609, page 76,",
          "text": "Determining whether a graph has a hamiltonian path or circuit is NP-complete [3]. The problem remains NP-complete for cubic planar graphs [3], for maximal planar graphs [9], and for planar digraphs [3]. It can be trivially solved in polynomial time for planar acyclic digraphs."
        },
        {
          "ref": "2018, Gregory Gutin, 3. Acyclic Digraphs, Jørgen Bang-Jensen, Gregory Gutin, Classes of Directed Graphs, Springer, page 125,",
          "text": "Acyclic digraphs form a well-studied family of digraphs of great interest in graph theory, algorithms and applications."
        }
      ],
      "glosses": [
        "有向無環圖"
      ],
      "id": "zh-acyclic_digraph-en-noun-GlhPc7~f",
      "raw_tags": [
        "計算機科學"
      ],
      "topics": [
        "mathematics"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "acyclic directed graph"
    },
    {
      "word": "directed acyclic graph"
    },
    {
      "word": "DAG"
    }
  ],
  "word": "acyclic digraph"
}

{
  "categories": [
    "有1個詞條的頁面",
    "有詞條的頁面",
    "英語可數名詞",
    "英語名詞",
    "英語詞元"
  ],
  "forms": [
    {
      "form": "acyclic digraphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "lang": "英語",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "英語 圖論",
        "英語 計算機科學"
      ],
      "examples": [
        {
          "ref": "1993, Suh-Ryung-Kim, The Competition Number and Its Variants, J. Gimbel, J.W. Kennedy, L.V. Quintas (editors), Quo Vadis, Graph Theory?: A Source Book for Challenges and Directions, Elsevier (North-Holland), page 313,",
          "text": "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."
        },
        {
          "ref": "2009, Tamara Mchedlidze, Antonios Symvonis, Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs, Hung Q. Ngo (editor), Computing and Combinatorics: 15th Annual International Conference, Proceedings, Springer, LNCS 5609, page 76,",
          "text": "Determining whether a graph has a hamiltonian path or circuit is NP-complete [3]. The problem remains NP-complete for cubic planar graphs [3], for maximal planar graphs [9], and for planar digraphs [3]. It can be trivially solved in polynomial time for planar acyclic digraphs."
        },
        {
          "ref": "2018, Gregory Gutin, 3. Acyclic Digraphs, Jørgen Bang-Jensen, Gregory Gutin, Classes of Directed Graphs, Springer, page 125,",
          "text": "Acyclic digraphs form a well-studied family of digraphs of great interest in graph theory, algorithms and applications."
        }
      ],
      "glosses": [
        "有向無環圖"
      ],
      "raw_tags": [
        "計算機科學"
      ],
      "topics": [
        "mathematics"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "acyclic directed graph"
    },
    {
      "word": "directed acyclic graph"
    },
    {
      "word": "DAG"
    }
  ],
  "word": "acyclic digraph"
}