Most and least uniform spanning trees

Citations of this article
Mendeley users who have this article in their library.
Get full text


We consider as objective function the maximum difference between the weights of components in a spanning tree. Components may be single arcs or paths, the objective functions may be minimized (most uniform) or maximized (least uniform), the graph may or may not be directed and the arc weights may or may not be restricted to positive values. We also explore some matroid generalizations of the above problems. In each case we present an efficient algorithm to achieve the optimum or prove that the problem is NP-hard. © 1986.




Camerini, P. M., Maffioli, F., Martello, S., & Toth, P. (1986). Most and least uniform spanning trees. Discrete Applied Mathematics, 15(2–3), 181–197.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free