報(bào)告題目：Dense Subgraph Computation over Large Sparse Graphs

報(bào)告時(shí)間：2023年11月15日上午10:00

報(bào)告地點(diǎn)：437bwin必贏國際官網(wǎng)B404會(huì)議室

報(bào)告人：常利軍

報(bào)告人國籍：中國香港

報(bào)告人單位：悉尼大學(xué)

報(bào)告人簡介：Dr. Lijun Chang is an associate professor in the School of Computer Science at The University of Sydney. He was an ARC DECRA research fellow and an ARC future fellow. He received his Bachelor degree from Renmin University of China and Ph.D. degree from The Chinese University of Hong Kong. His research interests are in the fields of big graph (network) analytics, with a focus on designing practical algorithms and developing theoretical foundations for massive graph analysis. He has published over 100 papers in top-tier conferences and journals such as SIGMOD, PVLDB, ICDE, VLDB Journal and TKDE.

報(bào)告摘要：With the rapid development of information technology, huge volumes of graph data are accumulated. Real graphs are usually sparsely connected from a global point of view, but typically contain subgraphs that are locally densely connected. It is of great importance to identify dense (i.e., cohesive) subgraphs in a large sparse graph. In this talk, I will discuss some of my recent works in dense subgraph computation. First, I will focus on the problem of densest subgraph computation and its variants such as locally densest subgraph and anchored densest subgraph. Then, I will talk about clique and its variants such as k-plex and k-defective cliques.

邀請(qǐng)人：祝園園