GARUDA: A System for Large-Scale Mining of Statistically Significant Connected Subgraphs
Summary: GARUDA is a system for scalable mining of statistically significant connected subgraphs in large real-world graphs. It emphasizes a user-friendly GUI, a modular architecture, and a demonstration of real tasks with 8–10× speedups over the MSCS state-of-the-art. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,784 | Machine Learning Meets Big Spatial Data | 2019 | VLDB | 4.4473392e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 576 | Substructure Similarity Search in Graph Databases | 2005 | SIGMOD | 0.00019858777 |
| 1,095 | GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph | 2014 | VLDB | 0.00014103799 |
| 2,557 | NeMa: Fast Graph Search with Label Similarity | 2013 | VLDB | 8.5484449e-05 |
| 6,571 | Mining Statistically Significant Connected Subgraphs in Vertex Labeled Graphs | 2014 | SIGMOD | 5.0014639e-05 |
Previous
Page 1 / 1
Next