Please choose the timezone that matches your location to ensure the dates and times below are correct. This requires JavaScript enabled to work properly.

Session 4E: Algorithmic Issues in Graph Mining

First presentation

Chair: Lei Li

Start: 2021-11-03 13:00

End: 2021-11-03 14:10

Second presentation


Start: 2021-11-04 01:00

End: 2021-11-04 02:10

Papers in this session

rgfp0475 Graph Embedding Based on Euclidean Distance Matrix and its Applications
rgfp0342 Scaling Up Distance-generalized Core Decomposition
rgfp0948 Agenda: Robust Personalized PageRanks in Evolving Graphs
rgfp0668 AdaSim: A Recursive Similarity Measure in Graphs
rgfp0053 Pareto-optimal Community Search on Large Bipartite Graphs
rgfp0461 Fast and Accurate Anchor Graph-based Label Prediction
rgfp0729 Comprehensively Computing Link-based Similarities by Building A Random Surfer Graph
rgfp0036 Minimizing Spectral Radius of Non-Backtracking Matrix by Edge Removal
  • Papers highlighted in green indicate the paper is selected for a live spotlight presentation.
  • Papers highlighted in gold indicate the paper has been shortlisted for a best paper award (and will also be presented live).
This programme is indicative. Once registered, please refer to the session programme on Underline.