Sentence examples for graphs that contain from inspiring English sources

In large sparse graphs, the compression performs best for graphs that contain many reasonably sized cliques.

In real-world graphs, a large amount of edges have a Jaccard Index or HPI value 0, especially for graphs that contain many low degree nodes.

Furthermore we have solved the clique-colouring problem for classes of graphs that contain very special non-separable p-connected graphs.

In this article we study the effects of offering feedback to annotations, namely by presenting word graphs that contain the architect's annotations and semantic associations based on these words.

In this section we will show that the clique-chromatic number of any graph which is not a non-separable p-connected graph is equal to 2. In the next sections we shall consider classes of graphs that contain non-separable p-connected graphs of special type.

Values presented in graphs that contain error bars represent means and standard deviations from three or more independent experiments.

Specifically, a k-NK query obtains k closest pairs of vertices, (vi,ui), in the RDF graph, that contain two given keywords q and w, respectively, such that ui is the nearest vertex of vi that contains the keyword w.

Instead of blindly searching through the entire DDI network G for partial-complete bipartite graphs, we use GO information to guide the search so that the search space is significantly reduced to only those sub-graphs that contain functionally related domains and their interacting partners.

A chordal graph is a graph that contains no induced cycle of length four or greater.

The starting point of WLO is a signal flow graph that contains information about the signal FxP formats and the data dependencies.

This decision is done based on the concept of greedy graph of a state s, i.e., the graph that contains all reachable states from s following the greedy policy.