Efficient embeddings of trees in hypercubes

Efficient embeddings of trees in hypercubes

Bibliographic Details
Corporate Author: University of Massachusetts at Amherst Department of Computer and Information Science
Other Authors: Bhatt, S. N, Chung, F. R. K, Leighton, F. T, Rosenberg, A. L
Format: Book
Language:English
Published: 1988
Subjects:
Binary trees
Boolean hypercube
Congestion
Dilation
Expansion
Graph embedding
Tree decomposition

Internet

This item is not available through BorrowDirect. Please contact your institution’s interlibrary loan office for further assistance.

Stanford University

Holdings details from Stanford University
Call Number: 112876
ISIL:US-CST

Similar Items