Abstract
AbstractWe prove that, for an undirected graph with n vertices and m edges, each labeled with a linear function of a parameter $$\lambda $$
λ
, the number of different minimum spanning trees obtained as the parameter varies can be $$\Omega (m\log n)$$
Ω
(
m
log
n
)
.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science