BOOMER: A Tool for Blending Visual P-Homomorphic Queries on Large Networks
Summary: Boomer blends visual subgraph query formulation with bounded 1-1 p-homomorphic queries on large networks. It extends beyond subgraph isomorphism, enabling interactive, GUI-driven querying with flexible bound-path semantics and strong performance. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yinglong Song
- 2. Huey Eng Chua
- 3. Sourav S Bhowmick
- 4. Byron Choi
- 5. Shuigeng Zhou
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 260 | Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling | 2013 | SIGMOD | 0.00030020929 |
| 1,419 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00012072488 |
| 2,943 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB | 7.8463193e-05 |
| 5,593 | GBLENDER: Visual Subgraph Query Formulation Meets Query Processing | 2011 | SIGMOD | 5.4172045e-05 |
| 6,313 | QUBLE: Blending Visual Subgraph Query Formulation with Query Processing on Large Networks | 2013 | SIGMOD | 5.1108902e-05 |
| 6,965 | BOOMER: Blending Visual Formulation and Processing of P-Homomorphic Queries on Large Networks | 2018 | SIGMOD | 4.8759021e-05 |
Previous
Page 1 / 1
Next