On the Hardness of Optimization in Power Law Graphs
From MaRDI portal
Publication:3608866
Vertex degrees (05C07) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- On the hardness of optimization in power-law graphs
- Hardness complexity of optimal substructure problems on power-law graphs
- On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs
- New techniques for approximating optimal substructure problems in power-law graphs
- Approximation algorithms for optimization problems in random power-law graphs
Cited in
(14)- Greed is good for deterministic scale-free networks
- On the hardness of optimization in power-law graphs
- Hardness complexity of optimal substructure problems on power-law graphs
- Approximation algorithms for optimization problems in random power-law graphs
- On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs
- Connections in Networks: Hardness of Feasibility Versus Optimality
- New techniques for approximating optimal substructure problems in power-law graphs
- Algorithmic complexity of power law networks
- Greed is good for deterministic scale-free networks
- scientific article; zbMATH DE number 2086615 (Why is no real title available?)
- Finding cliques in social networks: a new distribution-free model
- Finding cliques in social networks: a new distribution-free model
- On positive-influence target-domination
- Hardness Results and Efficient Algorithms for Graph Powers
This page was built for publication: On the Hardness of Optimization in Power Law Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608866)
