@inproceedings{c3179b02d6924f66873498fab9c883e1,
title = "Shared-Memory Graph Truss Decomposition",
abstract = "We present PKT, a new shared-memory parallel algorithm and OpenMP implementation for the truss decomposition of large sparse graphs. A k-truss is a dense subgraph definition that can be considered a relaxation of a clique. Truss decomposition refers to a partitioning of all the edges in the graph based on their k-truss membership. The truss decomposition of a graph has many applications. We show that our new approach PKT consistently outperforms other truss decomposition approaches for a collection of large sparse graphs and on a 24-core shared-memory server. PKT is based on a recently proposed algorithm for k-core decomposition.",
author = "Humayun Kabir and Kamesh Madduri",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 24th IEEE International Conference on High Performance Computing, HiPC 2017 ; Conference date: 18-12-2017 Through 21-12-2017",
year = "2017",
month = jul,
day = "2",
doi = "10.1109/HiPC.2017.00012",
language = "English (US)",
series = "Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "13--22",
booktitle = "Proceedings - 24th IEEE International Conference on High Performance Computing, HiPC 2017",
address = "United States",
}