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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
