The star degree centrality problem: a decomposition approach
From MaRDI portal
Publication:5084632
Recommendations
- On the star decomposition of a graph: hardness results and approximation for the max-min optimization problem
- Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
- scientific article; zbMATH DE number 5126095
- Induced star partition of graphs
- Star partitions on graphs
Cites work
- A survey of computational methods in protein-protein interaction networks
- Accelerating the Benders decomposition method: application to stochastic network design problems
- An integer programming approach for finding the most and the least central cliques
- Benders decomposition for large-scale uncapacitated hub location
- Benders decomposition for production routing under demand uncertainty
- Benders decomposition for very large scale partial set covering and maximal covering location problems
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Centers of complex networks
- Combinatorial Benders cuts for the minimum tollbooth problem
- Counting independent sets in graphs
- Detecting a most closeness-central clique in complex networks
- Finding clique clusters with the highest betweenness centrality
- Finding groups with maximum betweenness centrality
- Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem
- Integrated airline schedule design and fleet assignment: polyhedral analysis and Benders' decomposition approach
- Logic-based Benders decomposition for scheduling a batching machine
- Maximum independent sets near the upper bound
- Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures
- On the number of graphs without 4-cycles
- On using approximations of the Benders master problem
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- Partitioning procedures for solving mixed-variables programming problems
- The centrality of groups and classes
Cited in
(2)
This page was built for publication: The star degree centrality problem: a decomposition approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084632)
