Detailed Experimental Results for ALENEX'19 Publication "Scalable Edge Partitioning"

This website accompanies our ALENEX'19 publication.

Detailed Per-Instance Results

We provide detailed per-instance results for all our experiments in csv format:

Solution Quality of SPAC+X and HGP

• hMetis-K
• hMetis-R
• Ja-Be-Ja-VC
• KaHIP-Strong
• KaHyPar-MF
• METIS
• NE
• PaToH
• Zoltan-AlgD
• Zoltan

Solution Quality of dSPAC+X and dHGP

• dSPAC+ParHIP-Eco
• dSPC+ParHIP-Fast
• dSPAC_ParMETIS
• Zoltan
• dSPAC+ParHIP-Eco Running Time Breakdown
• dSPC+ParHIP-Fast Running Time Breakdown
• dSPAC_ParMETIS Running Time Breakdown

Scalability and Solution Quality of dSPAC+X

• ParHIP-Fast
• ParMETIS
• dSPAC Construction

Code

The code is integrated into the KaHIP graph partitioning framework: http://algo2.iti.kit.edu/kahip/