Sentence examples for graph tree from inspiring English sources

Also, we classify all rings whose annihilating graphs are complete graph, tree or cycle.

A graph tree data structure with a topology similar to common trees is introduced to transform the control flow graphs of target programs.

The results were visualized as a directed acyclic graph (tree) in order to show the relationship among the enriched GO categories.

Pattern recognition allows visualisation of the relationships in a directed graph (tree) that assists the user in deriving biological conclusions.

All the terms in the graph tree are links to the browser, such that a term clicked in the graph view becomes the selected browser term and the page is redrawn accordingly.

As a result, the system is built around a cognitive intelligent sensory system using so-called situation graph trees as a planning/control tool [1].

The operating of the system (Figure 2) is controlled using a software kernel built around an intelligent component using situation graph trees (shortly SGTs) [1] as the planning/control tool.

Unrooted gene trees can be analyzed through various methods of tree-cutting, the most famous so far being the methods of quartet decomposition that can inform us about evolution without necessarily providing a grand rooted unified evolutionary scheme, or requiring the reduction to a single graph (tree-like or web-like).

S (v ) = S (v ) / max v ∈ V { S (v ) } The way we calculate the relative importance of nodes and edges is inspired by graph tree-decomposition, which is used to simplify a graph as a tree in which each vertex represents a highly connected subgraph component and each edge represents the intersection between two adjacent components.

This paper proposes a generic high-performance and low-time-overhead software control flow checking solution, graph-tree-based control flow checking (GTCFC) for space-borne commercial-off-the-shelf (COTS) processors.

In this paper, we have proposed three construction heuristics H1, H2 and H3 and performed experiments on Grids, Small graphs, Trees and Harwell Boeing graphs, totaling 248 instances of graphs.