EMBEDDINGS OF COMPLETE BINARY TREES INTO EXTENDED GRIDS WITH EDGE-CONGESTION 1∗

DOI10.1080/10637199608915560zbMath1049.68505OpenAlexW2091365703MaRDI QIDQ4820160

No author found.

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199608915560

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (3)

NETWORK PROPERTIES OF DOUBLE AND TRIPLE FIXED STEP GRAPHS ⋮ Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1 ⋮ An optimal embedding of cycles into incomplete hypercubes

Cites Work

• Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1

This page was built for publication: EMBEDDINGS OF COMPLETE BINARY TREES INTO EXTENDED GRIDS WITH EDGE-CONGESTION 1∗