@inproceedings{f043b4aae9f34517869ed757d11b151d,
title = "Parallel k-truss decomposition on multicore systems",
abstract = "We discuss our submission to the HPEC 2017 Static Graph Challenge on k-truss decomposition and triangle counting. Our results use an algorithm called PKT (Parallel k-truss) designed for multicore systems. We are able to process almost all Graph Challenge datasets in under a minute on a 24-core server with 128 GB memory. For a synthetic Graph500 graph with 17 million vertices and 523 million edges, triangle counting takes 16 seconds and truss decomposition takes 29 minutes on the 24-core server.",
author = "Humayun Kabir and Kamesh Madduri",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE High Performance Extreme Computing Conference, HPEC 2017 ; Conference date: 12-09-2017 Through 14-09-2017",
year = "2017",
month = oct,
day = "30",
doi = "10.1109/HPEC.2017.8091052",
language = "English (US)",
series = "2017 IEEE High Performance Extreme Computing Conference, HPEC 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2017 IEEE High Performance Extreme Computing Conference, HPEC 2017",
address = "United States",
}