About the Project
objects. A classic and important graph problem, subgraph matching, is confronting new challenges
arising from higher graph analysis demands in the big data era. This project explores the theoretical
limitations and best practices of subgraph matching when the dataset size exceeds the memory
limit. The theoretical study will match the upper and lower bounds with provably optimal solutions,
while the empirical study will explore novel approaches to finding efficient solutions. Its success
will enrich the knowledge and benefit the huge number of practitioners in graph analysis.
Potential candidates should have:
1) Master degree by thesis in Computer Science or related areas.
2) Solid programming/coding skills and are familiar with algorithms and data structures.
3) English proficiency: IELTS 6.5+
Please refer to the following link on the requirements and application procedure for a PhD admission at UoA:
If interested, please send your CV, transcript records and a brief biography to Dr. Miao Qiao via email .
Based on your current searches we recommend the following search filters.
Based on your current search criteria we thought you might be interested in these.