Integer programming approach to static monopolies in graphs
From MaRDI portal
Recommendations
- A study of monopolies in graphs
- Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
- On dynamic monopolies of graphs with general thresholds
- Dynamic monopolies for interval graphs with bounded thresholds
- Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
- Applications and efficient algorithms for integer programming problems on monotone constraints
- On dynamic monopolies of graphs with probabilistic thresholds
- On monopoly and dynamic monopoly of Cartesian product of graphs with constant thresholds.
- Integer Programming Subject to Monomial Constraints
Cites work
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- A linear algorithm for finding a minimum dominating set in a cactus
- A linear time algorithm for computing longest paths in cactus graphs
- A study of monopolies in graphs
- Combinatorial algorithms on a class of graphs
- Combinatorial model and bounds for target set selection
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Graph theory
- On dynamic monopolies of graphs with general thresholds
- On dynamic monopolies of graphs with probabilistic thresholds
- On dynamic monopolies of graphs: the average and strict majority thresholds
- On the 0,1 facets of the set covering polytope
- On the facial structure of the set covering polytope
- On the global offensive alliance number of a graph
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
- Spread of influence in weighted networks under time and budget constraints
Cited in
(7)- A property of solutions to linear monopoly problems
- Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives
- Monopoly
- Facets of the dynamic monopoly polytope: linear ordering formulation
- A polyhedral approach to least cost influence maximization in social networks
- A study of monopolies in graphs
- A polyhedral study of dynamic monopolies
This page was built for publication: Integer programming approach to static monopolies in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752610)
