3 citations · 7 across the 6 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.SI2019
Graph Iso/Auto-morphism: A Divide-&-Conquer Approach
Can Lu, Jeffrey Xu Yu, Zhiwei Zhang +1
The graph isomorphism is to determine whether two graphs are isomorphic. A closely related problem is automorphism detection, where an isomorphism between two graphs is a bijection…
cs.SI2019★ 3 cited
Mining Bursting Communities in Temporal Graphs
Hongchao Qin, Rong-Hua Li, Guoren Wang +3
Temporal graphs are ubiquitous. Mining communities that are bursting in a period of time is essential to seek emergency events in temporal graphs. Unfortunately, most previous stud…