Embeddings of star graphs into optical meshes without bends

DOI10.1006/JPDC.1997.1356MaRDI QIDQ1373859zbMATH OpenOpenAlexFDO

Authors Stefan Thomas Obenaus, Ted H. Szymanski

Publication date 20 April 1998

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1997.1356

zbMATH Keywords

optical communicationstar graph

Mathematics Subject Classification ID

Computer system organization (68M99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Embedding meshes on the star graph
• Embedding star networks into hypercubes
• scientific article; zbMATH DE number 1760010
• Embedding complete binary trees into star networks
• Path embedding in star graphs

Cited in

(5)

• On the two-dimensional orthogonal drawing of series-parallel graphs
• On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
• Orthogonal drawings and crossing numbers of the Kronecker product of two cycles
• Embedding star networks into hypercubes
• scientific article; zbMATH DE number 1760010 (Why is no real title available?)

This page was built for publication: Embeddings of star graphs into optical meshes without bends

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373859)