To access this element change to forms mode OFF
Grant Award View - GA2265-V2
Efficient processing of large scale multi-dimensional graphs
GA ID:
GA2265-V2
Agency:
Australian Research Council
Approval Date:
10-Nov-2017
Variation Publish Date:
20-Oct-2021
Variation Date:
12-Oct-2021
Category:
Science, Technology, Engineering and Mathematics (STEM) Research
Grant Term:
1-Jan-2018 to 31-Dec-2020
Value (AUD):
$407,947.00
(GST inclusive where applicable)
Varies:
GA2265
- Efficient processing of large scale multi-dimensional graphs
One-off/Ad hoc:
No
Aggregate Grant Award:
No
PBS Program Name:
ARC 17/18 Discovery
Grant Program:
Discovery Projects
Grant Activity:
Efficient processing of large scale multi-dimensional graphs
Purpose:
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.
Internal Reference ID:
DP18 Round 1
Selection Process:
Targeted or Restricted Competitive
Confidentiality - Contract:
No
Confidentiality - Outputs:
No
Grant Recipient Details
Recipient Name:
The University of New South Wales
Recipient ABN:
57 195 873 179
Grant Recipient Location
Suburb:
KENSINGTON
Town/City:
KENSINGTON
Postcode:
2033
State/Territory:
NSW
Country:
AUSTRALIA
Grant Delivery Location
State/Territory:
NSW
Postcode:
2033
Country:
AUSTRALIA