@inproceedings{3fec9f1a38414e8d8f24f4de56ab1432,
title = "Abusing a hypergraph partitioner for unweighted graph partitioning",
abstract = "We investigate using the Mondriaan matrix partitioner for unweighted graph partitioning in the communication volume and edgecut metrics. By converting the unweighted graphs to appropriate matrices, we measure Mondriaan{\textquoteright}s performance as a graph partitioner for the 10th DIMACS challenge on graph partitioning and clustering. We find that Mondriaan can effectively be used as a graph partitioner: w.r.t. the edge-cut metric, Mondriaan{\textquoteright}s average results are within 21% of the best known results as listed in Chris Walshaw{\textquoteright}s partitioning archive.",
author = "{Fagginger Auer}, B.O. and R.H. Bisseling",
note = "10th DIMACS Implementation Challenge Workshop, February 13-14, 2012",
year = "2013",
doi = "10.1090/conm/588/11707",
language = "English",
volume = "588",
series = "Contemporary Mathematics",
publisher = "American Mathematical Society",
pages = "19--35",
editor = "Bader, {David A.} and Henning Meyerhenke and Peter Sanders and Dorothea Wagner",
booktitle = "Graph Partitioning and Graph Clustering",
address = "United States",
}