"acyclic digraph" meaning in All languages combined

{
  "forms": [
    {
      "form": "acyclic digraphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "acyclic digraph (plural acyclic digraphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "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,\nIn 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."
        },
        {
          "text": "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,\nDetermining 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."
        },
        {
          "text": "2018, Gregory Gutin, 3. Acyclic Digraphs, Jørgen Bang-Jensen, Gregory Gutin, Classes of Directed Graphs, Springer, page 125,\nAcyclic digraphs form a well-studied family of digraphs of great interest in graph theory, algorithms and applications."
        }
      ],
      "glosses": [
        "A directed acyclic graph, a finite directed graph that contains no directed cycles."
      ],
      "id": "en-acyclic_digraph-en-noun-~NLtLnGa",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "computer science",
          "computer science"
        ],
        [
          "directed acyclic graph",
          "directed acyclic graph"
        ],
        [
          "finite",
          "finite"
        ],
        [
          "directed graph",
          "directed graph"
        ],
        [
          "cycle",
          "cycle"
        ]
      ],
      "raw_glosses": [
        "(graph theory, computer science) A directed acyclic graph, a finite directed graph that contains no directed cycles."
      ],
      "synonyms": [
        {
          "sense": "directed graph without cycles",
          "word": "acyclic directed graph"
        },
        {
          "alt": "DAG",
          "sense": "directed graph without cycles",
          "word": "directed acyclic graph"
        }
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "graph-theory",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "wikipedia": [
        "Directed acyclic graph"
      ]
    }
  ],
  "word": "acyclic digraph"
}

{
  "forms": [
    {
      "form": "acyclic digraphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "acyclic digraph (plural acyclic digraphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer science",
        "en:Graph theory"
      ],
      "examples": [
        {
          "text": "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,\nIn 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."
        },
        {
          "text": "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,\nDetermining 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."
        },
        {
          "text": "2018, Gregory Gutin, 3. Acyclic Digraphs, Jørgen Bang-Jensen, Gregory Gutin, Classes of Directed Graphs, Springer, page 125,\nAcyclic digraphs form a well-studied family of digraphs of great interest in graph theory, algorithms and applications."
        }
      ],
      "glosses": [
        "A directed acyclic graph, a finite directed graph that contains no directed cycles."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "computer science",
          "computer science"
        ],
        [
          "directed acyclic graph",
          "directed acyclic graph"
        ],
        [
          "finite",
          "finite"
        ],
        [
          "directed graph",
          "directed graph"
        ],
        [
          "cycle",
          "cycle"
        ]
      ],
      "raw_glosses": [
        "(graph theory, computer science) A directed acyclic graph, a finite directed graph that contains no directed cycles."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "graph-theory",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "wikipedia": [
        "Directed acyclic graph"
      ]
    }
  ],
  "synonyms": [
    {
      "sense": "directed graph without cycles",
      "word": "acyclic directed graph"
    },
    {
      "alt": "DAG",
      "sense": "directed graph without cycles",
      "word": "directed acyclic graph"
    }
  ],
  "word": "acyclic digraph"
}