MDS-FSM: Coverage-Based Frequent Subgraph Mining in Single Graphs
Summary: MDS introduces a polynomial-time, anti-monotone coverage support between MIS and MNI, penalizing redundant embedding overlap in single-graph FSM. Orbit compression, separability, and progressive bounds enable scalable mining without exhaustive enumeration. (summarized by gpt-5.6-luna on Aug 17 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Xiaozhen Guo (Tianjin University)
- 2. Xueli Liu (Tianjin University)
- 3. Bowen Dong (Tianjin University)
- 4. Li Wan (Tianjin University)
- 5. Jiake Ge (Tianjin University)
- 6. Shuai Ma (Beihang University)
BibTeX Citation
@article{guo_vldb26,
title = {{MDS-FSM: Coverage-Based Frequent Subgraph Mining in Single Graphs}},
author = {Guo, Xiaozhen and Liu, Xueli and Dong, Bowen and Wan, Li and Ge, Jiake and Ma, Shuai},
journal = {PVLDB},
series = {{VLDB} '26},
volume = {19},
number = {9},
pages = {2276--2288},
doi = {10.14778/3819518.3819550},
url = {https://doi.org/10.14778/3819518.3819550},
year = {2026}
}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 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 960 | Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together | 2019 | SIGMOD | 0.00012836554 |
| 1,027 | GraMI: Frequent Subgraph and Pattern Mining in a Single Large Graph | 2014 | VLDB | 0.00012422544 |
| 1,900 | Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching | 2021 | SIGMOD | 9.4059063e-05 |
| 6,440 | Maverick: Discovering Exceptional Facts from Knowledge Graphs | 2018 | SIGMOD | 5.7842039e-05 |
| 7,251 | T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph | 2023 | SIGMOD | 5.574104e-05 |
| 8,037 | Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs | 2017 | SIGMOD | 5.4019783e-05 |
| 8,891 | Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds | 2025 | VLDB | 5.2559789e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,916 | Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques | 2022 | VLDB |
| 2 | 10,788 | Subgraph Enumeration: Beyond Tree Decomposition | 2026 | VLDB |
| 3 | 10,562 | Efficient and Scalable Directed Densest Subgraph Discovery | 2026 | SIGMOD |
| 4 | 3,789 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 5 | 8,891 | Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds | 2025 | VLDB |
| 6 | 2,042 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 7 | 8,342 | Mining Top-k Pairs of Correlated Subgraphs in a Large Network | 2020 | VLDB |
| 8 | 11,321 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 9 | 11,220 | In-depth Analysis of Densest Subgraph Discovery in a Unified Framework | 2025 | VLDB |
| 10 | 8,037 | Flexible and Feasible Support Measures for Mining Frequent Patterns in Large Labeled Graphs | 2017 | SIGMOD |