Author： Damian Mirela Pemmaraju Sriram V.
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.40, Iss.1, 2004-06, pp. : 1-14
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. :
Access to resources
Recommend
Computing Diameter in the Streaming and Sliding-Window Models
By Feigenbaum Joan Kannan Sampath Zhang Jian
Algorithmica, Vol. 41, Iss. 1, 2004-10 ,pp. :
Improved heuristics for the bounded-diameter minimum spanning tree problem
Soft Computing, Vol. 11, Iss. 10, 2007-08 ,pp. :