We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Volume 12 Issue 5
September  1997
Peng Guoqiang. Mapping Between 2-D Meshes of the Same Size[J]. Journal of Computer Science and Technology, 1997, 12(5): 470-475.
Citation: Peng Guoqiang. Mapping Between 2-D Meshes of the Same Size[J]. Journal of Computer Science and Technology, 1997, 12(5): 470-475.

Mapping Between 2-D Meshes of the Same Size

More Information
  • Published Date: September 09, 1997
  • Given two 2-D meshes 1171 and MZ of sizes si x t; where si≤ti(i=1, 2) and s1 x fl=s2 x t2, embedding Ml to MZ with minimum dilation is……….
  • [1]
    Akers S B, Harel D, Krishnamurthy B. The star graph: An attractive alternative to the n-cube. In Int'l. Conf. Parallel Processing, 1987, pp.393-400.
    [2]
    Hong J W, Mehlhorn K, Rosenberg A L. Cost tradeoffs in graph embeddings. J. ACM, 1983 30(4): 709-728.
    [3]
    Chen C Y R, Chung Y C. Embedding networks with ring connections in hypercube machines. In Int'l. Conf. Parallel Processing, 1990, Vo1.3, pp.327-334. ……….

Catalog

    Article views (25) PDF downloads (1388) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return