Improved Bound for Dilation of an Embedding onto Circulant Networks

DOI10.1007/978-3-030-01123-9_62zbMath1452.68140OpenAlexW2914879617MaRDI QIDQ3296854

T. M. Rajalaxmi, R. Sundara Rajan, Mirka Miller, Joseph F. Ryan

Publication date: 2 July 2020

Published in: Trends in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-01123-9_62

zbMATH Keywords

treeembeddingbinary treedilationhypertreecirculant networksibling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Dense sets and embedding binary trees into hypercubes
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• Wirelength of hypercubes into certain trees
• 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 numberings and isoperimetric problems on graphs
• New binary coding results by circulants
• Embedding complete trees into the hypercube

This page was built for publication: Improved Bound for Dilation of an Embedding onto Circulant Networks