DBScholar

Back to papers

A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery

Summary: Direct mining framework for constrained graph pattern discovery. SkinnyMine mines l-long delta-skinny patterns via canonical diameter ensuring completeness and unique generation; introduces reducibility and continuity for qualified constraints. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4718
Venue
SIGMOD
Year
2013
Pagerank
5.093636e-05
Overall Rank
12,241 | 16.02%
DOI
10.1145/2463676.2463723

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{zhu_sigmod13,
        title = {{A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery}},
        author = {Zhu, Feida and Zhang, Zequn and Qu, Qiang},
        series = {{SIGMOD} '13},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2463676.2463723},
        url = {https://dl.acm.org/doi/10.1145/2463676.2463723},
        year = {2013}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,002 ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks 2016 SIGMOD 5.7280021e-05
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.

Previous Page 1 / 1 Next

Semantically Similar Papers