Computing a directed minimum spanning tree, called arborescence, is a
fu...
The hitting set problem asks for a collection of sets over a universe U ...
We study the maximum-flow/minimum-cut problem on scale-free networks, i....
Hyperbolic random graphs (HRG) and geometric inhomogeneous random graphs...
share