Benchmarking for Graph Clustering and Partitioning

  • David A. Bader
  • , Andrea Kappes
  • , Henning Meyerhenke
  • , Peter Sanders
  • , Christian Schulz
  • , Dorothea Wagner

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Scopus citations

Abstract

Benchmarking: Performance evaluation for comparison to the state of the art Benchmark suite: Set of instances used for benchmarking Benchmarking refers to a repeatable performance evaluation as a means to compare somebody’s work to the state of the art in the respective field. As an example, benchmarking can compare the computing performance of new and old hardware. In the context of computing, many different benchmarks of various sorts have been used. A prominent example is the Linpack benchmark of the TOP500 list of the fastest computers in the world, which measures the performance of the hardware by solving a dense linear algebra problem. Different categories of benchmarks include sequential versus parallel, microbenchmark versus application, or fixed code versus informal problem description. See, e.g., (Weicker 2002) for a more detailed treatment of hardware evaluation. When it comes to….

Original languageEnglish (US)
Title of host publicationEncyclopedia of Social Network Analysis and Mining
Subtitle of host publicationSecond Edition
PublisherSpringer New York
Pages161-171
Number of pages11
ISBN (Electronic)9781493971312
ISBN (Print)9781493971305
DOIs
StatePublished - Jan 1 2018
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • General Mathematics
  • General Social Sciences

Keywords

  • Algorithm evaluation
  • Graph repository
  • Test instances

Fingerprint

Dive into the research topics of 'Benchmarking for Graph Clustering and Partitioning'. Together they form a unique fingerprint.

Cite this