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.90163MaRDI 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
90C35: Programming involving graphs or networks
91D30: Social networks; opinion dynamics
90C10: Integer programming
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Critical node/edge detection problems on trees, The stochastic critical node problem over trees, Graph clustering with Boltzmann machines, Component-cardinality-constrained critical node problem in graphs, Robust optimization of graph partitioning involving interval uncertainty, 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, The critical node detection problem in networks: a survey, Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem, Branch and cut algorithms for detecting critical nodes in undirected graphs, Exact identification of critical nodes in sparse networks via new compact formulations, Robust Critical Node Selection by Benders Decomposition, Graph Clustering Via Intra-Cluster Density Maximization
