[Cite as http://purl.org/au-research/grants/arc/DP180103096]
Prof Xuemin Lin
Prof Ying Zhang
Prof Wenjie Zhang
Brief description Efficient processing of large scale multi-dimensional graphs. This project aims to develop novel approaches to process large scale multi-dimensional graphs. The project will focus on the three most representative types of problems against multi-dimensional graphs, namely cohesive subgraph computation, frequent subgraph mining, and subgraph matching. The project outcome will include a set of new theories, novel indexing and data processing techniques, including distributed and single node computation. The success of the project will significantly contribute to the technology development and the scientific foundation of big graph processing.
Funding Amount $407,947
Funding Scheme Discovery Projects
View this grant in the ARC Data Portal