Browsing Department of Informatics by Subject "VDP::Matematikk: 410"
Now showing items 1-1 of 1
-
Towards stronger Lagrangean bounds for stable spanning trees
(Chapter, 2022)Given a graph G=(V,E) and a set C of unordered pairs of edges regarded as being in conflict, a stable spanning tree in G is a set of edges T inducing a spanning tree in G, such that for each {e_i, e_j} in C, at most one ...