Efficient Cohesive-Subgraph Search over Large Graphs

点击翻译按钮获取中文摘要

Cohesive-subgraph searching is highly demanded by many applications that deal with large graphs, such as community searching, social marketing, crime detection, and collaborative tagging systems. This project aims to develop effective and efficient techniques to search cohesive subgraphs of particular interest to end-users that are defined by a set of query vertices or a set of query labels (keywords). This project aims to develop, analyse, implement, and evaluate novel indexing and query processing techniques to effectively and efficiently support a set of primitive cohesive-subgraph search queries. The project aims to provide technological breakthroughs and be beneficial for both science and society in Australia.