Improved lower bounds for embedding hypercubes on de Bruijn graphs

Authors:
Stefka Fidanova;Denis R. Trystram
Affiliations:
CLPP-BAS, Academia Bonchev str. bl.25A, 1113 Sofia, Bulgaria;ID-IMAG, 51 Rue Jean Kuntzmann, 38330 Montbonnot St. Martin, France
Venue:
Journal of Parallel and Distributed Computing
Year:
2004

Citing 3
Cited 0

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Embeddings of hypercubes and grids into de Bruijn graphs

Journal of Parallel and Distributed Computing
Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract