Affordable Access

Publisher Website

An optimal embedding of cycles into incomplete hypercubes

Authors
Journal
Information Processing Letters
0020-0190
Publisher
Elsevier
Publication Date
Volume
72
Identifiers
DOI: 10.1016/s0020-0190(99)00139-8
Keywords
  • Cycle
  • Embedding
  • Incomplete Hypercube
  • Interconnection Networks
Disciplines
  • Computer Science

Abstract

Abstract In order to use existing algorithms for rings and linear arrays on other architectures, the embedding of cycles has been an important issue. In this paper, we propose an optimal algorithm to embed cycles of arbitrary length into incomplete hypercubes.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Improved book-embeddings of incomplete hypercubes

on Discrete Applied Mathematics Jan 01, 2009

Cycles embedding in hypercubes with node failures

on Information Processing Letters Jan 01, 2007

Cycles embedding in exchanged hypercubes

on Information Processing Letters Jan 01, 2009
More articles like this..