3 citations · 4 across the 4 of their papers we have counts for
4 papers
A Fast Maximum Clique Algorithm Based on Network Decomposition for Large Sparse Networks
Tianlong Fan, Wenjun Jiang, Yi-Cheng Zhang +1
Finding maximum cliques in large networks is a challenging combinatorial problem with many real-world applications. We present a fast algorithm to achieve the exact solution for th…
A Quick Framework for Evaluating Worst Robustness of Complex Networks
Wenjun Jiang, Peiyan Li, Tianlong Fan +4
Robustness is pivotal for comprehending, designing, optimizing, and rehabilitating networks, with simulation attacks being the prevailing evaluation method. Simulation attacks are…
Network higher-order structure dismantling
Peng Peng, Tianlong Fan, Linyuan Lü
Diverse higher-order structures, foundational for supporting a network's "meta-functions", play a vital role in structure, functionality, and the emergence of complex dynamics. Nev…
Unveiling Explosive Vulnerability of Networks through Edge Collective Behavior
Peng Peng, Tianlong Fan, Xiao-Long Ren +1
Edges, binding together nodes within networks, have the potential to induce dramatic transitions when specific collective failure behaviors emerge. These changes, initially unfoldi…