Title
The Feedback Vertex Set Problem Of Multiplex Networks
Abstract
The feedback vertex set (FVS) problem of network aims to find a vertex subset of smallest size that contains at least one vertex of each cycle of the network. The FVS problem has found wide applications, ranging from circuit design, network security and network control and observation etc. However, the majority of existing studies on FVS problem are confined to single networks. In this brief, under the consideration of one kind of control problem of multiplex network, we introduce the concept of FVS of multiplex network. The control problem of multiplex network is naturally mapped into the FVS problem of multiplex network. We then propose two simulated annealing (SA) algorithms to solve the directed FVS problem of multiplex network and undirected FVS problem of multiplex network respectively. The effectiveness of the SA algorithms is finally verified on both artificial multiplex networks and real-world multiplex networks.
Year
DOI
Venue
2020
10.1109/TCSII.2020.2997974
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS
Keywords
DocType
Volume
Multiplexing, Law, Simulated annealing, Circuits and systems, Heuristic algorithms, Manganese, Feedback vertex set, multiplex network, control, simulated annealing
Journal
67
Issue
ISSN
Citations 
12
1549-7747
0
PageRank 
References 
Authors
0.34
0
5
Name
Order
Citations
PageRank
Dawei Zhao119320.38
Lijuan Xu210.69
Shao-Meng Qin300.34
Guangqi Liu400.34
Zhen Wang5106085.86