3 papers
cs.DS2020
Enhancing Balanced Graph Edge Partition with Effective Local Search
Zhenyu Guo, Mingyu Xiao, Yi Zhou +2
Graph partition is a key component to achieve workload balance and reduce job completion time in parallel graph processing systems. Among the various partition strategies, edge par…
cs.AI2020
APAN: Asynchronous Propagation Attention Network for Real-time Temporal Graph Embedding
Xuhong Wang, Ding Lyu, Mengjian Li +8
Limited by the time complexity of querying k-hop neighbors in a graph database, most graph algorithms cannot be deployed online and execute millisecond-level inference. This proble…
cs.DS2020
The Complexity of the Partition Coloring Problem
Zhenyu Guo, Mingyu Xiao, Yi Zhou
Given a simple undirected graph and a partition of the vertex set into parts, the \textsc{Partition Coloring Problem} asks if we can select one vertex from each p…