Embedding Circulant Networks into Butterfly and Benes Networks

DOI10.1007/978-3-319-19315-1_26zbMath1401.05100OpenAlexW2403053137MaRDI QIDQ2946066

N. Parthiban, R. Sundara Rajan, T. M. Rajalaxmi, Paul D. Manuel, Indra Rajasingh

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_26

zbMATH Keywords

embeddingdilationcirculant networkbutterfly and benes networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dense sets and embedding binary trees into hypercubes
• An efficient representation of Benes networks and its applications
• Efficient embeddings of ternary trees into hypercubes.
• Reliable circulant networks with minimum transmission delay
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
• Optimal distance networks of low degree for parallel computers
• Embedding complete trees into the hypercube

This page was built for publication: Embedding Circulant Networks into Butterfly and Benes Networks