411 citations · 1.1k across the 7 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 12 cited
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw H. Gebremedhin +2
The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, informatics, and many other areas. Although there exist several algor…
astro-ph.IM2012★ 95 cited
A Parallel Monte Carlo Code for Simulating Collisional N-body Systems
Bharath Pattabiraman, Stefan Umbreit, Wei-Keng Liao +4
We present a new parallel code for computing the dynamical evolution of collisional N-body systems with up to N~10^7 particles. Our code is based on the the Henon Monte Carlo metho…