Research on key network node identification based on depth - first search algorithm

DOI

10.2991/ifmca-16.2017.14How to use a DOI?

Keywords

complex networks; topological properties; key nodes

Abstract

The recognition of critical nodes has important application value in the real world. On the one hand, it can improve the survivability of the network by improving their performance, on the other hand, they can also destroy some networks by deliberately attacking them. In this paper, DSF algorithm is proposed to identify key nodes in the network. Experimental results show that the proposed method can identify key nodes efficiently and effectively.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Hao Sun
AU  - Xiaoxia Cai
AU  - Zufeng Zhang
PY  - 2017/03
DA  - 2017/03
TI  - Research on key network node identification based on depth - first search algorithm
BT  - Proceedings of the 2016 International Forum on Mechanical, Control and Automation (IFMCA 2016)
PB  - Atlantis Press
SP  - 90
EP  - 93
SN  - 2352-5401
UR  - https://doi.org/10.2991/ifmca-16.2017.14
DO  - 10.2991/ifmca-16.2017.14
ID  - Sun2017/03
ER  -