Efficient algorithms for subgraph counting and enumeration on large graphs
This thesis delves into critical challenges associated with subgraph analysis in large-scale graphs. The proliferation of data in domains such as social networks, Internet applications, and biological networks necessitates a deep understanding of relationships modeled as graphs. The complexity and s...
Saved in:
Main Author: | Wang, Kaixin |
---|---|
Other Authors: | Long Cheng |
Format: | Thesis-Doctor of Philosophy |
Language: | English |
Published: |
Nanyang Technological University
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/176240 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
GPU-accelerated subgraph enumeration on partitioned graphs
by: GUO, Wentian, et al.
Published: (2020) -
Subgraph extraction algorithm for large scale heterogeneous graph
by: Wu, Eric JiaQing
Published: (2024) -
Cohesive subgraph mining in large graphs
by: Yu, Kaiqiang
Published: (2023) -
On the intersection graph of isomorphic subgraphs of a graph
by: Lomibao, Bernadette G., et al.
Published: (2009) -
The intersection graph of isomorphic subgraphs of a graph
by: Garcia, Mark Anthony A., et al.
Published: (2008)