Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$

DOI10.1051/ita/1993270504651zbMath0803.68091OpenAlexW37864402MaRDI QIDQ4288206

A. Bel Hala

Publication date: 2 January 1995

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92461

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Mathematical problems of computer architecture (68M07)

Related Items (3)

Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes ⋮ On bandwidth, cutwidth, and quotient graphs ⋮ Cutwidth of the de Bruijn graph

Cites Work

• Unnamed Item
• Unnamed Item
• A framework for solving VLSI graph layout problems
• On embeddings in cycles
• Topological Bandwidth
• The bandwidth problem for graphs and matrices—a survey
• Placement of the processors of a hypercube
• Optimal numberings and isoperimetric problems on graphs
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Congestion optimale du plongement de l’hypercube $H (n)$ dans la chaîne $P(2^n)$