11 search results - page 3 / 3 » On shredders and vertex connectivity augmentation |
SAC
2003
ACM
14 years 21 days ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...