Related references
Note: Only part of the references are listed.Efficient Radius-Bounded Community Search in Geo-Social Networks
Kai Wang et al.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2022)
Efficient and Effective Community Search on Large-scale Bipartite Graphs
Kai Wang et al.
2021 IEEE 37TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2021) (2021)
Hierarchical Core Maintenance on Large Dynamic Graphs
Zhe Lin et al.
PROCEEDINGS OF THE VLDB ENDOWMENT (2021)
A survey of community search over big graphs
Yixiang Fang et al.
VLDB JOURNAL (2020)
Efficient (α, β)-core computation in bipartite graphs
Boge Liu et al.
VLDB JOURNAL (2020)
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs
Kai Wang et al.
2020 IEEE 36TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2020) (2020)
Anchored Vertex Exploration for Community Engagement in Social Networks
Taotao Cai et al.
2020 IEEE 36TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2020) (2020)
Efficient (α, β)-core Computation: an Index-based Approach
Boge Liu et al.
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019) (2019)
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks
Kai Wang et al.
PROCEEDINGS OF THE VLDB ENDOWMENT (2019)
Index-Based Densest Clique Percolation Community Search in Networks
Long Yuan et al.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2018)
Efficient Computing of Radius-Bounded k-Cores
Kai Wang et al.
2018 IEEE 34TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE) (2018)
Peeling Bipartite Networks for Dense Subgraph Discovery
Ahmet Erdem Sariyuce et al.
WSDM'18: PROCEEDINGS OF THE ELEVENTH ACM INTERNATIONAL CONFERENCE ON WEB SEARCH AND DATA MINING (2018)
Butterfly Counting in Bipartite Networks
Seyed-Vahid Sanei-Mehri et al.
KDD'18: PROCEEDINGS OF THE 24TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING (2018)
Finding weighted k-truss communities in large networks
Zibin Zheng et al.
INFORMATION SCIENCES (2017)
Effective and efficient attributed community search
Yixiang Fang et al.
VLDB JOURNAL (2017)
Efficient Fault-Tolerant Group Recommendation Using α-β-core
Danghao Ding et al.
CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT (2017)
Truss-based Community Search: a Truss-equivalence Based Indexing Approach
Esra Akbas et al.
PROCEEDINGS OF THE VLDB ENDOWMENT (2017)
A Fast Order-Based Approach for Core Maintenance
Yikai Zhang et al.
2017 IEEE 33RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2017) (2017)
Attribute-Driven Community Search
Xin Huang et al.
PROCEEDINGS OF THE VLDB ENDOWMENT (2017)
Effective Community Search over Large Spatial Graphs
Yixiang Fang et al.
PROCEEDINGS OF THE VLDB ENDOWMENT (2017)
Incremental k-core decomposition: algorithms and evaluation
Ahmet Erdem Sariyuce et al.
VLDB JOURNAL (2016)
Efficient and effective community search
Nicola Barbieri et al.
DATA MINING AND KNOWLEDGE DISCOVERY (2015)
On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types
Yun Zhang et al.
BMC BIOINFORMATICS (2014)
Local Search of Communities in Large Graphs
Wanyun Cui et al.
SIGMOD'14: PROCEEDINGS OF THE 2014 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA (2014)
s-core network decomposition: A generalization of k-core analysis to weighted networks
Marius Eidsaa et al.
PHYSICAL REVIEW E (2013)
Streaming Algorithms for k-core Decomposition
Ahmet Erdem Sariyuece et al.
PROCEEDINGS OF THE VLDB ENDOWMENT (2013)
A k-shell decomposition method for weighted networks
Antonios Garas et al.
NEW JOURNAL OF PHYSICS (2012)
Scientific collaboration networks. I. Network construction and fundamental results
MEJ Newman
PHYSICAL REVIEW E (2001)
Share Paper
