Cohesive subgraph mining in large graphs
Graphs are widely used to model entities and their relationships in different domains and some examples include social networks and biological networks. To analyse these graph data, cohesive subgraph mining is a fundamental approach which has attracted increasing attention from academics and industr...
Saved in:
Main Author: | Yu, Kaiqiang |
---|---|
Other Authors: | Long Cheng |
Format: | Thesis-Doctor of Philosophy |
Language: | English |
Published: |
Nanyang Technological University
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/171775 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Cohesive subgraphs discovery in networks
by: Kim, Junghoon
Published: (2022) -
Parallel graph algorithm
by: Nguyen, Duc Hieu.
Published: (2012) -
Efficient techniques for subgraph mining and query processing
by: Lin, Wenqing
Published: (2015) -
Efficient adaptive approximation algorithms in online social networks
by: Huang, Keke
Published: (2020) -
Efficient algorithms for subgraph counting and enumeration on large graphs
by: Wang, Kaixin
Published: (2024)