Parallel algorithms for the minimum cut and the minimum length tree layout problems

By Diaz J.   Gibbons A.   Pantziou G.E.   Serna M.J.   Spirakis P.G.   Toran J.  

Theoretical Computer Science, Vol. 181, Iss. 2, 1997-07 ,pp. : 267-287

Elsevier

Access to resources Recommend Favorite

Histograms based on the minimum description length principle

By Wang Hai  

The VLDB Journal, Vol. 17, Iss. 3, 2008-05 ,pp. : 419-442

Springer Publishing Company

Access to resources Recommend Favorite

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees

By Gouveia Luis  

Annals of Operations Research, Vol. 146, Iss. 1, 2006-09 ,pp. : 19-39

Springer Publishing Company

Access to resources Recommend Favorite

Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree

By Spriggs Michael J.   Keil J. Mark   Bespamyatnikh Sergei   Segal Michael   Snoeyink Jack  

Algorithmica, Vol. 38, Iss. 4, 2004-01 ,pp. : 577-589

Springer Publishing Company

Access to resources Recommend Favorite

Improved heuristics for the bounded-diameter minimum spanning tree problem

By Singh Alok   Gupta Ashok  

Soft Computing, Vol. 11, Iss. 10, 2007-08 ,pp. : 911-921

Springer Publishing Company

Access to resources Recommend Favorite