HomeEvents10th DIMACS Implementation Challenge – Graph Partitioning and Graph Clustering

10th DIMACS Implementation Challenge – Graph Partitioning and Graph Clustering

Add to Calendar
Date:
February 13, 2012 8:45 am - February 14, 2012 1:15 pm
Location:
Klaus Advanced Computing Bldg, Room 1116
Cost:
Registration required - fee varies. Register at website

10th DIMACS Implementation Challenge – Graph Partitioning and Graph Clustering

http://www.cc.gatech.edu/dimacs10/index.shtml

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)

 

DIMACS Implementation Challenges address questions of determining realistic algorithm performance where worst case analysis is overly pessimistic and probabilistic models are too unrealistic: experimentation can provide guides to realistic algorithm performance where analysis fails."

For the 10th DIMACS Implementation Challenge, the two related problems of graph partitioning and graph clustering were chosen. Graph partitioning and graph clustering are among the aforementioned questions or problem areas where theoretical and practical results deviate significantly from each other, so that experimental outcomes are of particular interest.