Pages that link to "Item:Q2481967"
From MaRDI portal
The following pages link to On the hardness of optimization in power-law graphs (Q2481967):
Displayed 11 items.
- Approximability of the vertex cover problem in power-law graphs (Q385960) (← links)
- New techniques for approximating optimal substructure problems in power-law graphs (Q443723) (← links)
- Inapproximability of dominating set on power law graphs (Q476891) (← links)
- On positive influence dominating sets in social networks (Q621845) (← links)
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
- On the approximability of positive influence dominating set in social networks (Q2015789) (← links)
- Greed is good for deterministic scale-free networks (Q2205637) (← links)
- The Complexity and Approximability of Minimum Contamination Problems (Q3010410) (← links)
- Modeling and Designing Real–World Networks (Q3637327) (← links)
- (Q5002730) (← links)
- Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)