Directed Network Disassembly Method Based on Non-Backtracking Matrix
نویسندگان
چکیده
Network disassembly refers to the removal of minimum set nodes split network into disconnected sub-part achieve effective control network. However, most existing work only focuses on undirected networks, and there are few studies directed because when edges in directed, application methods will lead a higher cost disassembly. Aiming at fixing problem, an edge module method based non-backtracking matrix is proposed. This combines spectrum partition problem find key points connecting different modules for removal. applied large-scale artificial real networks verify its effectiveness. Multiple experimental results show that proposed has great advantages accuracy computational efficiency.
منابع مشابه
Non-Deterministic Lisp with Dependency-directed Backtracking
Extending functional Lisp with McCarthy’s nondeterministic operator AHFJ yields a language which can concisely express search problems. Dependencydirected backtracking is a powerful search strategy. We describe a non-deterministic Lisp dialect called SCHEMER and show that it can provide automatic dependency-directed backtracking. The resulting language provides a convenient interface to this ef...
متن کاملLocalized eigenvector of the non-backtracking matrix
Emergence of localized eigenvectors can cause a failure of standard spectral method for graph partitioning. The spectral method using the non-backtracking matrix was proposed as a way to overcome this problem. The numerical experiments on several examples of real networks show that, indeed, the non-backtracking matrix does not exhibit localization of eigenvectors. We show that, however, localiz...
متن کاملConstraint-Directed Backtracking
We propose a new backtracking algorithm called constraint-directed backtracking (CDBT) for solving general constraint-satisfaction problems (CSPs). CDBT and the naive backtracking (BT) share a similar style of instantiating and re-instantiating variables. They diier in that CDBT searches for an assignment to variables in a variable set from the given constraint posed on that variable set and ap...
متن کاملWarehouse Layout Method Based on Ant Colony and Backtracking Algorithm
Warehouse is one of the important aspects of a company. Therefore, it is necessary to improve Warehouse Management System (WMS) to have a simple function that can determine the layout of the storage goods. In this paper we propose an improved warehouse layout method based on ant colony algorithm and backtracking algorithm. The method works on two steps. First, it generates a solutions parameter...
متن کاملAssessing Percolation Threshold Based on High-Order Non-Backtracking Matrices
Percolation threshold of a network is the critical value such that when nodes or edges are randomly selected with probability below the value, the network is fragmented but when the probability is above the value, a giant component connecting a large portion of the network would emerge. Assessing the percolation threshold of networks has wide applications in network reliability, information spr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2022
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app122312047