Pages that link to "Item:Q2701066"
From MaRDI portal
The following pages link to Solving vertex cover in polynomial time on hyperbolic random graphs (Q2701066):
Displaying 4 items.
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q4606331) (← links)
- The impact of heterogeneity and geometry on the proof complexity of random satisfiability (Q6063345) (← links)
- Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) (← links)
- A probabilistic algorithm for vertex cover (Q6144024) (← links)