Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Parallel routing algorithms for incomplete hypercube interconnection networks

From MaRDI portal
Publication:1349985
Jump to:navigation, search

DOI10.1016/0167-8191(94)90129-5zbMath0875.68050OpenAlexW1969801946MaRDI QIDQ1349985

Kuo-Lung Ku, M. S. Horng, Deng-Jyi Chen

Publication date: 27 February 1997

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(94)90129-5


zbMATH Keywords

HypercubeInterconnection networksParallel routing algorithm


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computer system organization (68M99) Distributed algorithms (68W15)


Related Items

On linear layout of bicube and construction of optimal incomplete bicube ⋮ Improved book-embeddings of incomplete hypercubes ⋮ Embedding the incomplete hypercube in books ⋮ Embedding cycles and meshes onto incomplete hypercubes



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1349985&oldid=13485745"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:03.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki