— 10th DIMACS Implementation Challenge - Graph Partitioning and Graph Clustering —

Co-sponsored by DIMACS and by the Command, Control, and Interoperability Center for Advanced Data Analysis (CCICADA),
Pacific Northwest National Laboratory, Sandia National Laboratories, Intel Corporation and Deutsche Forschungsgemeinschaft (DFG)

  • Home
  • Participation
  • Schedule
  • Downloads
  • Submission
  • Workshop
  • Organization
  • Contact
  • Links

Co-Sponsors

  • The Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)
  • Command, Control, and Interoperability Center for Advanced Data Analysis (CCICADA)
  • Pacific Northwest National Laboratory
  • Sandia National Laboratories
  • Intel Corporation
  • Deutsche Forschungsgemeinschaft (DFG)

Further Links

  • Previous DIMACS Implementation Challenges
  • The ACM Journal of Experimental Algorithmics
  • 10th International Symposium on Experimental Algorithms (SEA11)
  • 19th European Symposium on Algorithms (ESA11)
  • Algorithm Engineering and Experiments (ALENEX12)
  • SIAM Conference on Parallel Processing for Scientific Computing (PP12)
  • DIMACS10 test set and the University of Florida Sparse Matrix Collection

 
Book cover of 10th Challenge
  • News

    • Jan 23, 2015: A new paper has been published in the Encyclopedia of Social Network Analysis and Mining.
    • Feb 18, 2013: The Challenge book will be published by AMS soon.
    • Mar 31, 2012: The challenge results are online.
    • Mar 30, 2012: Archive update: New graph category Star Mixtures.
    • Feb 24, 2012: Most talk slides are available.
    • Feb 10, 2012: Final workshop program online!
    • Jan 23, 2012: The challenge instances have been announced. Happy computing!
    • Dec 27, 2011: Tim Mattson (Intel) has joined the advisory board. Welcome, Tim!
    • Dec 1 and 12, 2011: Updated workshop registration information, new graphs in category numerical!
    • Nov 7, 2011: Thank you for your submissions! New details on workshop times available!
    • Sep 21, 2011: Updated workshop and venue information.
    • Sep 12, 2011: Archive update: New graph category Redistricting.
    • Jul 26, 2011: Archive update: New graph category Erdös-Rényi, additions to category Clustering (see the description page for details). The new archive size is about 35GB.
    • Jul 7, 2011: Minor update of objective functions to handle some pathological cases.
    • Jun 28, 2011: The call for papers is online.
    • Apr 15, 2011: The scoring rules and objective functions are now available!
    • Apr 1, 2011: Maintenance in the testbed archive nearly completed. Some additions and descriptions are still expected. Changes of and additions to the testbed data from this point on will be announced on the mailing list.
    • Mar 14, 2011: A few changes in the directory structure and file names have been made to improve consistency. All testbed files (approx. 20GB) are now downloadable with wget -r -np http://www.cc.gatech.edu/dimacs10/archive/data/. Note that the webserver creates a few additional HTML files (mostly directory listings).
    • Feb 1, 2011: Official Challenge launch!
    • Jan 7, 2011: The website is published at its permanent location.
  • Previous Challenges

    • The Shortest Path Problem (2006)
    • Traveling Salesman Problem (2001)
    • Full list
 

Website created and maintained by Henning Meyerhenke. Design based on the template Deviation by Free CSS Templates.