Author： Chang Chung-Hao Lin Cheng-Kuan Tan Jimmy Huang Hua-Min Hsu Lih-Hsing
Publisher： Springer Publishing Company
ISSN： 0920-8542
Source： The Journal of Supercomputing, Vol.48, Iss.1, 2009-04, pp. : 66-87
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
Super link-connectivity of iterated line digraphs
By Cheng X. Du X. Min M. Q. Ngo H. Ruan L. Sun J. Wu W.
Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. :
Access to resources
Recommend
On the Euclidean Minimum Spanning Tree Problem
Computing Letters, Vol. 1, Iss. 1, 2005-01 ,pp. :
Improving spanning trees by upgrading nodes
By Krumke S.O. Noltemeier H. Wirth H.-C. Marathe M.V. Ravi R. Ravi S.S. Sundaram R.
Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. :
Antecedents of Boundary Spanning E-Collaboration
International Journal of e-Collaboration (IJeC), Vol. 11, Iss. 2, 2015-04 ,pp. :