Embedding meshes of trees into deBruijn graphs

DOI10.1016/0020-0190(92)90217-JzbMath0764.68131MaRDI QIDQ1199946

Eric J. Schwabe

Publication date: 17 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmsinterconnection networksde Bruijn graphgraph embeddingsmesh of trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Distributed algorithms (68W15)

Related Items (2)

Real-time emulations of bounded-degree networks ⋮ Embedding a mesh of trees in the crossed cube

Cites Work

• Unnamed Item
• Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
• Parallel Processing with the Perfect Shuffle

This page was built for publication: Embedding meshes of trees into deBruijn graphs