In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0;1]d and a degree constraint b 2. The aim is to nd a minimum weight spannin...
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
Christopher J. Quinn, Todd P. Coleman, Negar Kiyav...
This paper describes a methodology for designing interconnected LAN-MAN networks with the objective of minimizing the average network delay. We consider IEEE 802.3-5 LANs intercon...