ACM SRC poster: a scalable group testing based algorithm for finding d-highest betweenness centrality vertices in large scale networks

Sanjukta Bhowmick, Vyacheslav V. Rykov, Vladimir Ufimtsev. ACM SRC poster: a scalable group testing based algorithm for finding d-highest betweenness centrality vertices in large scale networks. In Scott Lathrop, Jim Costa, William Kramer, editors, Conference on High Performance Computing Networking, Storage and Analysis - Companion Volume, SC 2011, Seattle, WA, USA, November 12-18, 2011. pages 121-122, ACM, 2011. [doi]

Abstract

Abstract is missing.