• QUALEX

  • Referenced in 49 articles [sw04742]
  • very efficient on the DIMACS benchmark graphs and various random maximum weight clique problem instances...
  • DibaP

  • Referenced in 14 articles [sw08343]
  • hierarchy construction methods, we obtain our new graph partitioning heuristic DibaP. Compared to Bubble ... slower algorithm. Experiments with popular benchmark graphs show that DibaP computes consistently better results than ... partitionings of six widely used benchmark graphs...
  • Graph transformation benchmarks

  • Referenced in 11 articles [sw04099]
  • Graph transformation benchmarks Benchmarking has a key role in decision making processes when a choice ... using several parameter combinations for measurements). Graph transformation provides a pattern and rule based manipulation ... approach. However, despite the large variety of graph transformation tools (AGG, Fujaba, GReAT, Groove, PROGRES ... tool providers. In case of graph transformation benchmarks the sole measurable feature, which composes...
  • UnitWalk

  • Referenced in 34 articles [sw00993]
  • performs well on many common benchmarks ranging from graph coloring problems to microprocessor verification...
  • LEMON

  • Referenced in 39 articles [sw05043]
  • with similar software packages, namely BGL (Boost Graph Library) and LEDA. LEMON turned ... these widely used libraries, and our benchmarks show that it typically outperforms them in efficiency...
  • Treewidthlib

  • Referenced in 13 articles [sw09228]
  • TreewidthLIB: A benchmark for algorithms for Treewidth and related graph problems. The notion of treewidth ... collection of graphs that can be used as benchmark for the comparison of algorithms computing...
  • BHOSLIB

  • Referenced in 15 articles [sw08220]
  • BHOSLIB: Benchmarks with Hidden Optimum Solutions for Graph Problems (Maximum Clique, Maximum Independent Set, Minimum...
  • EXTRACOL

  • Referenced in 9 articles [sw06552]
  • DIMACS} challenge benchmarks and show improved results for four very difficult graphs (DSJC1000.9, C2000.5, C2000.9...
  • ToTo

  • Referenced in 3 articles [sw19369]
  • both a central repository for important graphs and benchmark datasets and extend...
  • RDyn

  • Referenced in 1 article [sw28444]
  • RDyn: graph benchmark handling community dynamics. Graph models provide an understanding of the dynamics ... evolution; as a direct consequence, synthesizing graphs having controlled topology and planted partitions has been ... often identified as a strategy to describe benchmarks able to assess the performances of community...
  • SALBPGen

  • Referenced in 20 articles [sw14513]
  • required based on a detailed analysis of graph structures and structure measures like the order ... also present a collection of new challenging benchmark data sets which are suited for comprehensive...
  • Benchmarking

  • Referenced in 23 articles [sw14630]
  • Benchmarking: Benchmark and Frontier Analysis Using DEA and SFA. Methods for frontier analysis, Data Envelopment ... efficiency measures (input based, output based, hyperbolic graph, additive, super, and directional efficiency). Peers ... mergers is also supported. Methods for graphing the technology sets are also included. There ... complements the book, Bogetoft and Otto, Benchmarking with DEA, SFA, and R, Springer-Verlag...
  • mcMST

  • Referenced in 1 article [sw29266]
  • generation of multi-objective benchmark graph problems is included...
  • STMBench7

  • Referenced in 9 articles [sw08814]
  • benchmark for evaluating STM implementations. The underlying data structure consists of a set of graphs ... choose a workload, number of threads, benchmark length, as well as the possibility of structure...
  • SCCWalk

  • Referenced in 1 article [sw32102]
  • massive graphs. We carry out experiments to evaluate our algorithms on several popular benchmarks, which ... into two groups, including classical benchmarks of small graphs namely DIMACS, BHOSLIB, winner determination problem ... real-world graphs and large-scale FRB graphs. Experiments show that, compared to state ... classical benchmarks, and obtain the best solutions for most massive graphs...
  • subgraph2vec

  • Referenced in 3 articles [sw36496]
  • variant of Weisfeiler-Lehman graph kernel. Our experiments on several benchmark and large-scale real ... achieves significant improvements in accuracies over existing graph kernels on both supervised and unsupervised learning...
  • RotatE

  • Referenced in 1 article [sw37755]
  • present a new approach for knowledge graph embedding called RotatE, which is able to model ... RotatE model. Experimental results on multiple benchmark knowledge graphs show that the proposed RotatE model...
  • VLTS Benchmark Suite

  • Referenced in 5 articles [sw09810]
  • hereafter called benchmarks). Each Labelled Transition System is a directed, connected graph, whose vertices ... hidden transitions or tau-transitions). The VLTS benchmarks have been obtained from various case studies...
  • RedisGraph

  • Referenced in 1 article [sw32718]
  • Benchmarking RedisGraph: Today we are happy to announce the general availability of RedisGraph v1.0. RedisGraph ... module developed by Redis Labs to add graph database functionality to Redis. We released RedisGraph ... store, manage and process graphs. In fact, our initial benchmarks are already finding that RedisGraph ... than existing graph databases! Below, I’ll share how we’ve benchmarked RedisGraph v1.0...