Wirelength of hypercubes into certain trees

Authors:
Indra Rajasingh;Paul Manuel;Bharati Rajan;M. Arockiaraj
Affiliations:
Department of Mathematics, Loyola College, Chennai 600 034, India;Department of Information Science, Kuwait University, Safat, Kuwait;Department of Mathematics, Loyola College, Chennai 600 034, India;Department of Mathematics, Loyola College, Chennai 600 034, India
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 27
Cited 0

Incomplete Hypercubes

IEEE Transactions on Computers
Graph embeddings 1988: recent breakthroughs, new directions

VLSI Algorithms and Architectures
Simulating binary trees on hypercubes

VLSI Algorithms and Architectures
Efficient embeddings of trees in hypercubes

SIAM Journal on Computing
Incomplete hypercubes: algorithms and embeddings

The Journal of Supercomputing
On embedding binary trees into hypercubes

Journal of Parallel and Distributed Computing
A Boolean Expression-Based Approach for Maximum Incomplete Subcube Identification in Faulty Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Embedding ladders and caterpillars into the hypercube

Discrete Applied Mathematics - Special issue: network communications broadcasting and gossiping
Embedding of binomial trees in hypercubes with link faults

Journal of Parallel and Distributed Computing
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
Embeddings of complete binary trees into grids and extended grids with total vertex-congestion

Discrete Applied Mathematics
Optimal embeddings of generalized ladders into hypercubes

Discrete Mathematics
Embedding complete trees into the hypercube

Discrete Applied Mathematics
Introduction to algorithms

Introduction to algorithms
Optimal dynamic embeddings of complete binary trees into hypercubes

Journal of Parallel and Distributed Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Embedding of Hypercubes into Grids

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
The circular wirelength problem for hypercubes

The circular wirelength problem for hypercubes
Complete binary trees in folded and enhanced cubes

Networks
Embedding of cycles and wheels into arbitrary trees

Networks
Dense sets and embedding binary trees into hypercubes

Discrete Applied Mathematics
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

Journal of Graph Theory
On embedding subclasses of height-balanced trees in hypercubes

Information Sciences: an International Journal
Exact wirelength of hypercubes on a grid

Discrete Applied Mathematics
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks
Wirelength of 1-fault hamiltonian graphs into wheels and fans

Information Processing Letters

Quantified Score

Hi-index	0.04

Visualization

Abstract

A lot of research has been devoted to finding efficient embedding of trees into hypercubes. On the other hand, in this paper, we consider the problem of embedding hypercubes into k-rooted complete binary trees, k-rooted sibling trees, binomial trees and certain classes of caterpillars to minimize the wirelength.