Effective pruning techniques for mining quasi-cliques
10.1007/978-3-540-87481-2_3
Saved in:
Main Authors: | Liu, G., Wong, L. |
---|---|
Other Authors: | COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2013
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/40630 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Reproducibility report for ACM SIGMOD 2024 paper: 'Fast maximal quasi-clique enumeration: a pruning and branching co-design approach'
by: Meling, Hein, et al.
Published: (2025) -
Detecting hubs and quasi cliques in scale-free networks
by: Srihari, S., et al.
Published: (2013) -
Mining sub-trajectory cliques to find frequent routes
by: Aung, H.H., et al.
Published: (2014) -
Clique coverings and clique partitions of the K-power of graphs
by: Tanawat Wichianpaisarn
Published: (2014) -
Clique coverings and clique partitions of the K-power of graphs
by: Tanawat Wichianpaisarn
Published: (2007)