Enumeration of substructure patterns from large graphs
Graph is a ubiquitous data model and can be used to represent complex entities and their relationships, such as bioinformatics and biochemistry networks, traffic networks, communication networks, social networks, etc. This thesis study the problem of enumeration of fundamental substructure...
Main Author: | Chu, Shumo. |
---|---|
Other Authors: | Cong Gao |
Format: | Thesis |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/54633 |
Similar Items
-
Efficient algorithms for subgraph counting and enumeration on large graphs
by: Wang, Kaixin
Published: (2024) -
PICASSO : exploratory search of connected subgraph substructures in graph databases
by: Bhowmick, Sourav Saha, et al.
Published: (2019) -
Pattern mining in large graph database
by: Foon, Samuel Hoe Mun.
Published: (2012) -
Fast algorithms for maximal clique enumeration with limited memory
by: Cheng, James, et al.
Published: (2013) -
Improving large graph processing on partitioned graphs in the cloud
by: Chen, Rishan, et al.
Published: (2013)