Embedding meshes of trees into deBruijn graphs
type: Item
instance of: scholarly article
title: Embedding meshes of trees into deBruijn graphs
zbMATH Open document ID: 0764.68131
DOI: 10.1016/0020-0190(92)90217-J
author: Eric J. Schwabe
published in: Information Processing Letters
publication date: 1993-01-17T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 96285
zbMATH Keywords: graph embeddings
zbMATH Keywords: interconnection networks
zbMATH Keywords: mesh of trees
zbMATH Keywords: parallel algorithms
zbMATH Keywords: de Bruijn graph
MaRDI profile type: Publication
cites work: Q4002466
cites work: Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
cites work: Parallel Processing with the Perfect Shuffle
Recommended article: Q4028115
Recommended article: On embedding graphs in trees
Recommended article: Q4862246
Recommended article: Embedding trees into graphs of large girth
Recommended article: Q4369764
Recommended article: Q4536930
Recommended article: Q3716296
Recommended article: Lattice embeddings of trees
Recommended article: Embedding nearly-spanning bounded degree trees
Recommended article: Embedding complete trees into the hypercube
description: scientific article; zbMATH DE number 96285