Embedding meshes on the star graph

DOI10.1006/jpdc.1993.1098zbMath0783.68014OpenAlexW1966443575MaRDI QIDQ1309221

Nangkang Yeh, Jhy-Chun Wang, Sanjay Ranka

Publication date: 20 December 1993

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

Full work available at URL: https://surface.syr.edu/eecs_techreports/60

zbMATH Keywords

embeddinginterconnection networksstar graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Related Items (12)

Cycle embedding in star graphs with more conditional faulty edges ⋮ Edge-bipancyclicity of star graphs with faulty elements ⋮ Largest connected component of a star graph with faulty vertices ⋮ Analytic performance comparison of hypercubes and star graphs with implementation constraints ⋮ A grid embedding into the star graph for image analysis solutions ⋮ Hamiltonian-laceability of star graphs ⋮ Embedding a family of disjoint multi-dimensional meshes into a crossed cube ⋮ Embedding of tori and grids into twisted cubes ⋮ Embedding longest fault-free paths onto star graphs with more vertex faults ⋮ Longest fault-free paths in star graphs with vertex faults ⋮ On randomized broadcasting in star graphs ⋮ Block-cyclic matrix triangulation on the Cartesian product of star graphs

This page was built for publication: Embedding meshes on the star graph