Login / Signup
Efficiently Approximating Vertex Cover on Scale-Free Networks with Underlying Hyperbolic Geometry.
Thomas Bläsius
Tobias Friedrich
Maximilian Katzmann
Published in:
Algorithmica (2023)
Keyphrases
</>
vertex cover
scale free networks
approximation algorithms
complex networks
scale free
planar graphs
complex systems
evaluation function
precedence constraints
small world networks