Scale-free spanning trees: complexity, bounds and algorithms

Yury Orlovich, Kirill Kukharenko, Volker Kaibel +1

We introduce and study the general problem of finding a most "scale-free-like" spanning tree of a connected graph. It is motivated by a particular problem in epidemiology, and may…