default search action
Parallel Computing, Volume 47
Volume 47, August 2015
- Aydin Buluç, Leonid Oliker, John R. Gilbert:
Special issue "Graph analysis for scientific discovery". 1-2 - Ahmet Erdem Sariyüce, Erik Saule, Kamer Kaya, Ümit V. Çatalyürek:
Incremental closeness centrality in distributed memory. 3-18 - Hao Lu, Mahantesh Halappanavar, Ananth Kalyanaraman:
Parallel heuristics for scalable community detection. 19-37 - James P. Fairbanks, Ramakrishnan Kannan, Haesun Park, David A. Bader:
Behavioral clusters in dynamic graphs. 38-50 - George M. Slota, Kamesh Madduri:
Parallel color-coding. 51-69 - Vince Lyzinski, Daniel L. Sussman, Donniell E. Fishkind, Henry Pao, Li Chen, Joshua T. Vogelstein, Youngser Park, Carey E. Priebe:
Spectral clustering for divide-and-conquer graph matching. 70-87
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.