Embedding meshes on the star graph
From MaRDI portal
Publication:1309221
DOI10.1006/jpdc.1993.1098zbMath0783.68014MaRDI 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
68R10: Graph theory (including graph drawing) in computer science
68M07: Mathematical problems of computer architecture
Related Items
Hamiltonian-laceability of star graphs, Longest fault-free paths in star graphs with vertex faults, Cycle embedding in star graphs with more conditional faulty edges, Embedding longest fault-free paths onto star graphs with more vertex faults, Edge-bipancyclicity of star graphs with faulty elements, A grid embedding into the star graph for image analysis solutions, Embedding of tori and grids into twisted cubes, Analytic performance comparison of hypercubes and star graphs with implementation constraints, Embedding a family of disjoint multi-dimensional meshes into a crossed cube, On randomized broadcasting in star graphs, Block-cyclic matrix triangulation on the Cartesian product of star graphs, Largest connected component of a star graph with faulty vertices