Embedding the incomplete hypercube in books

DOI10.1016/j.ipl.2005.05.026zbMath1184.68100OpenAlexW2046331281MaRDI QIDQ1044693

Jywe-Fei Fang, Kuan-Chou Lai

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.026

zbMATH Keywords

interconnection networkslayoutembedding in booksincomplete hypercubes

Mathematics Subject Classification ID

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

Related Items

Embedding generalized Petersen graph in books ⋮ A survey on book-embedding of planar graphs ⋮ Embedding complete multi-partite graphs into Cartesian product of paths and cycles ⋮ Wirelength of embedding complete multipartite graphs into certain graphs ⋮ Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength ⋮ Embedding of hypercubes into necklace, windmill and snake graphs ⋮ Embedding of the folded hypercubes into tori ⋮ Improved book-embeddings of incomplete hypercubes ⋮ Embedding connected double-loop networks with even cardinality in books

Cites Work

• Unnamed Item
• Unnamed Item
• Embedding planar graphs in four pages
• An effective routing algorithm in incomplete hypercubes
• Parallel routing algorithms for incomplete hypercube interconnection networks
• Optimum embedding of complete graphs in books
• Efficient generation of the binary reflected gray code and its applications
• Embedding cycles and meshes onto incomplete hypercubes
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design