Minimum-Mapping based Connected Components Algorithm
Finding connected components is a fundamental problem in graph analysis. We develop a
novel minimum-mapping based Contour algorithm to solve the connectivity problem. The …
novel minimum-mapping based Contour algorithm to solve the connectivity problem. The …
Robustness of double-layer group-dependent combat network with cascading failure
J Yu, B Xiao, Y Cui - Electronics, 2023 - mdpi.com
The networked combat system-of-system (CSOS) is the trend of combat development with
the innovation of technology. To achieve the combat effectiveness, studying the ability of …
the innovation of technology. To achieve the combat effectiveness, studying the ability of …
Damage Maximization for Combat Network With Limited Costs
J Yu, B Xiao, Y Cui - IEEE Access, 2022 - ieeexplore.ieee.org
Maximizing the damage by attacking specific nodes of the combat network can efficiently
disrupt enemies' defense capability, protect our critical units, and enhance the resistance to …
disrupt enemies' defense capability, protect our critical units, and enhance the resistance to …
[图书][B] Optimisation techniques for finding connected components in large graphs using GraphX
M Turifi - 2018 - search.proquest.com
The problem of finding connected components in undirected graphs has been well studied.
It is an essential pre-processing step to many graph computations, and a fundamental task …
It is an essential pre-processing step to many graph computations, and a fundamental task …