Minimum average congestion of enhanced and augmented hypercubes into complete binary trees

Authors:
Paul Manuel
Affiliations:
-
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 19
Cited 1

Incomplete Hypercubes

IEEE Transactions on Computers
On embedding graphs in trees

Journal of Combinatorial Theory Series B
Enhanced Hypercubes

IEEE Transactions on Computers
On the complexity of tree embedding problems

Information Processing Letters
Incomplete hypercubes: algorithms and embeddings

The Journal of Supercomputing
Two results on linear embeddings of complete binary trees

Theoretical Computer Science
Embedding ladders and caterpillars into the hypercube

Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
On embedding complete graphs into hypercubes

Discrete Mathematics
The cyclic cutwidth of trees

Discrete Applied Mathematics
The congestion of n-cube layout on a rectangular grid

Discrete Mathematics - Special issue on Selected Topics in Discrete Mathematics conferences
Optimal embeddings of generalized ladders into hypercubes

Discrete Mathematics
Uniform emulations of Cartesian-product and Cayley graphs

Discrete Applied Mathematics
Properties and Performance of Folded Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Fibonacci Cubes-A New Interconnection Topology

IEEE Transactions on Parallel and Distributed Systems
Embedding of Hypercubes into Grids

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Complete binary trees in folded and enhanced cubes

Networks
Embedding of cycles and wheels into arbitrary trees

Networks
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

Journal of Graph Theory
Exact wirelength of hypercubes on a grid

Discrete Applied Mathematics

Embedding of hypercubes into necklace, windmill and snake graphs

Information Processing Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

We study the embedding problem of enhanced and augmented hypercubes into complete binary trees. Using tree traversal techniques, we compute the minimum average edge congestion of enhanced and augmented hypercubes into complete binary trees.