Sentence examples for graphs that may from inspiring English sources

In the second part of the paper, we present postulates regarding the logical content of extensions of argument graphs that may be constructed with classical logic.

The relationship between events and durations can be systematically represented in a series of timelines and graphs that may better guide intuition.

A sound spectrograph is employed to record these waves in the form of a graph that may be compared to graphs of other individuals and differentiated.

These challenges include the addition or removal of edges to the graph that may redraw the dominator tree if a cycle is created or destroyed.

As the structure is corrected, so the application can generate a connectivity graph that may be used for substructure and similarity searching of chemical databases (interfaces for such searches may also be seen in Figure 6).

If both G and (overline{G}) are connected, then either G can be decomposed according to condition 3 of Theorem 2 and in this case G is called a decomposable neighbourhood graph or G is a p-connected graph that may be either separable or non-separable.

Established DGs are used to identify sub-graphs that may be overlapped with each other.

This would result in a severely restricted alignment graph that may miss biologically conserved regions in the networks.

The worst-case complexity of EdgeSearch is comparable to the O V) (V = number of vertices) of another heuristic method described in Vashist et al. (2007), but uses different topological information, i.e. triangles in a SymBets graph rather than dense clusters (quasi-cliques) in a graph that may include all edges and does not require a species tree.

Now, we recall some basic definitions from graph theory that may be found in any standard text on graph theory, for example [9].

Inspection of Fig. 10 allows us to identify high level graph sets that may be necessary in future work involving potential polymorphism and cocrystal design.