Pages that link to "Item:Q385960"

The following pages link to Approximability of the vertex cover problem in power-law graphs (Q385960):

Displaying 3 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)
• Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) (← links)