Utilizing weak graph for edge consolidation-based efficient enhancement of network robustness
Abstract Network robustness can be effectively augmented through edge safeguarding, especially when topology modification is not feasible. Although approximation algorithms are used due to the intrinsic hardness of problem, when the connectivity of the initial graph is adjusted to the desired value,...
Saved in:
| Main Authors: | Wei Ding, Zhengdan Wang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2025-05-01
|
| Series: | Complex & Intelligent Systems |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s40747-025-01922-9 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Spanning Tree of a Divisible Multiple Graph
by: Alexander V. Smirnov
Published: (2018-08-01) -
Edge connectivity of a neutrosophic graph
by: Aparna Tripathy, et al.
Published: (2025-04-01) -
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
by: Alexander Valeryevich Smirnov
Published: (2021-03-01) -
TOTAL EDGE IRREGULAR LABELING FOR TRIANGULAR GRID GRAPHS AND RELATED GRAPHS
by: Muhammad Nurul Huda, et al.
Published: (2023-06-01) -
Edge and Node Enhancement Graph Convolutional Network: Imbalanced Graph Node Classification Method Based on Edge-Node Collaborative Enhancement
by: Jiadong Tian, et al.
Published: (2025-03-01)