Document Type

Report

Date

8-1989

Embargo Period

4-30-2012

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.

Additional Information

School of Computer and Information Science, Syracuse University, CIS-89-9

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.