Sentence examples for size of the graph from inspiring English sources

In this case the algorithm produces an estimator Y which is provably close to Pr[F] with high probability in time polynomial in the size of the graph.

Also, we can reduce the size of the graph by replacing each frequently appearing graph pattern with a single node, and each reduced node represents a new concept.

Nevertheless, computing it in practice yields some difficulties as the size of the graph gets larger and larger, despite recent significant advances of semidefinite programming (SDP) solvers.

As a result, we have 2O √k)⋅nO(1) time algorithms for a wide variety of parameterized problems on graphs, where n is the size of the graph and k is the parameter.

Filtering rules are developed for this approach in order to reduce the size of the graph, and the problem is solved by successively removing infeasible paths from the graph.

The graph data are selected from different categories and the size of the graph data varies from small to medium.

Since the size of the graphs is increasing exponentially, many direct processes become more demanding.

The smAnotherld model used in the simulation developed was proposed by Kleingberg [31].

There are no limitations regarding the size of the graphs.

This is how, if needed, we can reduce the size of the graphs we deal with.

This distance threshold is used to decrease the size of the association graph and it is the reason why the initial graph matching stage is performed.