Counting Labeled Graphlets by Random Sampling

The Hong Kong University of Science and Technology
Department of Computer Science and Engineering

Final Year Thesis Oral Defense

Title: "Counting Labeled Graphlets by Random Sampling"

by

FANG Juanru

Abstract:

A graph is an abstract data type that can be used to represent computer 
networks, and knowledge bases; and the term graphlets are small connected 
induced subgraphs containing all the edges between its nodes that are 
present in the whole graph. By counting these graphlets, we can make 
inferences about the interaction of the nodes and analyze the local 
structures of the whole graph, which are useful for numbers of further 
analysis.

Counting unlabeled graphlets by random sampling has been well studied. 
However, increasing graphs are now using labels to represent more 
information. Therefore, this project aims to design and implement an 
algorithm to count graphlets for labeled graphs.


Date            : 9 May 2020 (Saturday)

Time            : 15:20 - 16:00

Zoom Meeting    : https://hkust.zoom.us/j/93200851035

Advisor         : Prof. YI Ke

2nd Reader      : Prof. DING Cunsheng