1 citations · 1 across the 2 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2024
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…
cs.SI2024★ 1 cited
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…