Exact wirelength of hypercubes on a grid
Discrete Applied Mathematics
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
Discrete Applied Mathematics
Wirelength of 1-fault hamiltonian graphs into wheels and fans
Information Processing Letters
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
Discrete Applied Mathematics
Embedding of hypercubes into necklace, windmill and snake graphs
Information Processing Letters
Wirelength of hypercubes into certain trees
Discrete Applied Mathematics
Embeddings of circulant networks
Journal of Combinatorial Optimization
Hi-index | 0.00 |
We consider the problem of selecting a core node in a network under two potentially competing criteria, one being the sum of the distances to a set of terminals, the other being the cost of connecting this core node and the terminals with a Steiner tree. ...