directed acyclic graph

This is also referred to as having a directed acyclic graph.

Instead this new structure that emerges is known as a directed acyclic graph.

The promise is the set of directed acyclic graphs.

The arrangement can be visualized in a directed acyclic graph.

Symbolic expressions are stored in memory as directed acyclic graphs.

It collapses the ancestor tree into a directed acyclic graph.

It may be assumed without loss of generality that G is a directed acyclic graph.

The vertex set of a directed acyclic graph ordered by reachability.

For the convenience of viewing these networks, there is a dependency and a directed acyclic graph.

Let G be a locally finite directed acyclic graph.

Code history has the structure of an directed acyclic graph which can be topologically sorted.

A directed acyclic graph of several (or all) possible retrosyntheses of a single target.

It is a directed acyclic graph where the nodes of the graph are factors.

Rooted trees are often treated as directed acyclic graphs with the edges pointing away from the root.

Note that a resolution proof can be seen as a general directed acyclic graph as opposed to a tree.

The new problem only contains binary constraints; their scopes form a directed acyclic graph.

For instance, consider the following problem: Given a directed acyclic graph, determine if the graph has a path of length 10.

Choosing an orientation for a forest produces a special kind of directed acyclic graph called a polytree.

Dataflow programming languages describe systems of values that are related to each other by a directed acyclic graph.

Retes are directed acyclic graphs that represent higher-level rule sets.

In other words, a polytree is a directed acyclic graph for which there are no undirected cycles either.

Reverse postordering produces a topological sorting of any directed acyclic graph.

The graph enumeration problem of counting directed acyclic graphs was studied by .

The string denotes a reference to the clause (the structure is now a directed acyclic graph rather than a tree).

A Boolean function can be represented as a rooted, directed acyclic graph of the following form: