Speaker:

Zhengren Wang (Undergraduate student in University of Electronic Science and Technology of China)

Time:

• 16:20-17:20 (Time in Beijing)
• 21:20-22:20 (Time in Auckland)
• April 1, 2022 (Friday)

Venue:

B1-518B, Research Building 4

Abstract:

This talk is a report of our paper Listing Maximal k-Plexes in Large Real-World Graphs on WWW’2022.

K-plexes often serve as a kind of relaxed-clique model for community discovery, social network analysis and web mining tasks. Compared with cliques, k-plexes allow every vertex missing at most k-1 edges to other vertices for better data-noise tolerance.

In this talk, an introduction of background and primitives will be given first. Then, we will show the framework, motivation and details of our algorithm. Finally, we will take some further discussion.