Times are displayed in Korea Standard Time (Asia/Seoul timezone - UTC+09:00)
Oral Session
Graph III
Diamond (B1),
15:00~16:40
Chair: Lijun Chang(The University of Sydney)
15:00-15:20
Efficient Closeness Centrality Computation for Dynamic Graphs
15:20-15:40
AOT: Pushing the Efficiency Boundary of Main-memory Triangle Listing
16:00-16:20
PDKE: An Efficient Distributed Embedding Framework For Large Knowledge Graphs
16:20-16:40
GQA_RDF: A Graph-based Approach towards Efficient SPARQL Query Answering
Sponsors