首页   按字顺浏览 期刊浏览 卷期浏览 EMBEDDINGS OF COMPLETE BINARY TREES INTO EXTENDED GRIDS WITH EDGE-CONGESTION 1*
EMBEDDINGS OF COMPLETE BINARY TREES INTO EXTENDED GRIDS WITH EDGE-CONGESTION 1*

 

作者: M.-C. HEYDEMANN,   D. SOTTEAU,   J. OPATRNY,  

 

期刊: Parallel Algorithms and Applications  （Taylor Available online 1996）
卷期: Volume 8, issue 3-4  

页码: 333-354

 

ISSN:1063-7192

 

年代: 1996

 

DOI:10.1080/10637199608915560

 

出版商: Taylor & Francis Group

 

数据来源: Taylor

 

摘要:

LetGandHbe two simple, undirected graphs. An embedding of the graphGinto the graphHis an injective mappingffrom the vertices ofGto the vertices ofH, together with a mapping which assigns to each edge [u, v] ofGa path betweenf(u) andf(v) inH.

 

点击下载:  PDF (420KB)



返 回