Sentence examples for benchmark graph from inspiring English sources

Some early work in this area is the Girvan Newman benchmark graph [23].

The quantum annealing algorithm has even found that the well-known benchmark graph dsjc1000.9 has a chromatic number of at most 222.

Indeed, some of the spectral graph measures for the field sites more closely approximate a purely hypothetical no-historical-contingency benchmark graph.

Finally, applications of the proposed method on a variety of synthetic benchmark graphs and real-life attributed graphs are demonstrated to verify the systematic performance.

The results on benchmark graphs led to the abstract construction of a worst-case input graph, which was a consequence of identifying The Problem of Ties.

These new approximation algorithms are exhibited on some of the small, intermediate and large benchmark graphs and the results are compared.

The resulting algorithm proves to be highly competitive when it is applied on the whole set of the DIMACS benchmark graphs.

The neural system has been tested on random and benchmark graphs, showing good performance with respect to the same heuristic for the same problems.

For 31 benchmark graphs of various types, the proposed harmony search algorithm is compared with a newly developed genetic algorithm and another genetic algorithm taken from the recent literature are presented.

We demonstrate several theoretical results on the regularization term and we further support the validity of this approach, reporting on its performances when applied to selected DIMACS benchmark graphs.

Experimental evaluations on a wide collection of benchmark graphs show that the proposed approach not only competes very favorably with the two well-known partitioning packages METIS and CHACO, but also improves more than two thirds of the best balanced partitions ever reported in the literature.