Pages that link to "Item:Q443723"
From MaRDI portal
The following pages link to New techniques for approximating optimal substructure problems in power-law graphs (Q443723):
Displaying 5 items.
- Minimum vertex cover in generalized random graphs with power law degree distribution (Q306728) (← links)
- Inapproximability of dominating set on power law graphs (Q476891) (← links)
- Greed is good for deterministic scale-free networks (Q2205637) (← links)
- On the hardness of optimization in power-law graphs (Q2481967) (← links)
- On the Hardness and Inapproximability of Optimization Problems on Power Law Graphs (Q3066157) (← links)