Author： Zhao L. Nagamochi H. Ibaraki T.
Publisher： Springer Publishing Company
ISSN： 1382-6905
Source： Journal of Combinatorial Optimization, Vol.5, Iss.4, 2001-12, pp. : 397-410
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Minimum Range Balanced Cuts via Dynamic Subset Sums
By Eppstein D.
Journal of Algorithms, Vol. 23, Iss. 2, 1997-05 ,pp. :
Access to resources
Recommend
A triangulated K3 surface with the minimum number of vertices
Topology, Vol. 40, Iss. 4, 2001-07 ,pp. :
Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation
Journal of Algorithms, Vol. 27, Iss. 2, 1998-05 ,pp. :
Clustering via minimum volume ellipsoids
Computational Optimization and Applications, Vol. 37, Iss. 3, 2007-07 ,pp. :