25 citations · 26 across the 2 of their papers we have counts for
2 papers
cs.DS2011★ 25 cited
Listing All Maximal Cliques in Large Sparse Real-World Graphs
David Eppstein, Darren Strash
We implement a new algorithm for listing all maximal cliques in sparse graphs due to Eppstein, Löffler, and Strash (ISAAC 2010) and analyze its performance on a large corpus of rea…
cs.CG2008★ 1 cited
Succinct Greedy Geometric Routing in the Euclidean Plane
Michael T. Goodrich, Darren Strash
In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to…