Author： Huang Chun-Hsi Rajasekaran Sanguthevar Yang Laurence He Xin
Publisher： Springer Publishing Company
ISSN： 1386-7857
Source： Cluster Computing, Vol.9, Iss.3, 2006-07, pp. : 345-353
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
Finding optimal paths in MREP routing
By Fleischer R. Golin M. Lea C.-T. Wong S.
Information Processing Letters, Vol. 89, Iss. 2, 2004-01 ,pp. :
Access to resources
Recommend
Gene clusters as intersections of powers of paths
By Costa Vítor
Journal of the Brazilian Computer Society, Vol. 18, Iss. 2, 2012-06 ,pp. :
The Complexity of Finding a Second Hamiltonian Cycle in Cubic Graphs
By Krawczyk A.
Journal of Computer and System Sciences, Vol. 58, Iss. 3, 1999-06 ,pp. :
Finding the number of clusters in ordered dissimilarities
By Sledge Isaac
Soft Computing, Vol. 13, Iss. 12, 2009-10 ,pp. :