Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
From MaRDI portal
Publication:3066154
DOI10.1007/978-3-642-17458-2_15zbMath1311.90163OpenAlexW1567877685MaRDI QIDQ3066154
Publication date: 8 January 2011
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17458-2_15
Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (13)
Component-cardinality-constrained critical node problem in graphs ⋮ Critical node/edge detection problems on trees ⋮ Branch and cut algorithms for detecting critical nodes in undirected graphs ⋮ The stochastic critical node problem over trees ⋮ Graph clustering with Boltzmann machines ⋮ Robust optimization of graph partitioning involving interval uncertainty ⋮ Exact identification of critical nodes in sparse networks via new compact formulations ⋮ Graph Clustering Via Intra-Cluster Density Maximization ⋮ The critical node detection problem in networks: a survey ⋮ The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks ⋮ A robust optimization approach for multicast network coding under uncertain link costs ⋮ Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem ⋮ Robust Critical Node Selection by Benders Decomposition
This page was built for publication: Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
