Document Type
Report
Date
8-1989
Keywords
Star graph, mesh, embedding, sorting
Language
English
Disciplines
Computer Sciences
Description/Abstract
We develop algorithms for mapping n-dimensional meshes on a star graph of degree n with expansion 1 and dilation 3. We show that an n degree star graph can efficiently simulate an n-dimensional mesh.
Recommended Citation
Ranka, Sanjay; Wang, Jhy-Chun; and Yeh, Nangkang, "Embedding Meshes on the Star Graph" (1989). Electrical Engineering and Computer Science - Technical Reports. 60.
https://surface.syr.edu/eecs_techreports/60
Source
local
Additional Information
School of Computer and Information Science, Syracuse University, CIS-89-9