Exact algorithm for network dismantling problem

DOI10.1088/1572-9494/AE63AEMaRDI QIDQ7409707zbMATH OpenFDO

Authors Yi-Ding Men, Wenbiao Xu, Zi-Song Shen, Pan Zhang

Publication date 2026

Published in Communications in Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/1572-9494/AE63AE

zbMATH Keywords

branch-and-boundexact solutionnetwork dismantlingpercolation transition

Mathematics Subject Classification ID

Quantum theory (81-XX)

Cites work

• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
• Community structure in social and biological networks
• Detecting critical nodes in sparse graphs
• Dismantling Sparse Random Graphs
• Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
• Exact ground states of two-dimensional \(\pm J\) Ising spin glasses
• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 4165188 (Why is no real title available?)
• Introduction: where statistical physics meets computation
• Minimal contagious sets in random regular graphs
• Reducibility among combinatorial problems
• Simulating Quantum Computation by Contracting Tensor Networks
• Solving k-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method
• Spectral redemption in clustering sparse networks
• Statistical mechanics of complex networks
• The non-backtracking spectrum of the universal cover of a graph

This page was built for publication: Exact algorithm for network dismantling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7409707)