QR link for Efficient algorithms for dilated mappings of binary trees
Add to Book Shelf
Flag as Inappropriate
Email this Book

Efficient algorithms for dilated mappings of binary trees

By Iqbal, M. Ashra

Click here to view

Book Id: WPLBN0002207996
Format Type: PDF eBook :
File Size: 1.2 MB
Reproduction Date: 2012

Title: Efficient algorithms for dilated mappings of binary trees  
Author: Iqbal, M. Ashra
Volume:
Language: English
Subject: BARS, DELAMINATING, ANISOTROPY
Collections: NASA Publication Collection
Historic
Publication Date:
1989
Publisher:

Citation

APA MLA Chicago

Ashra, I. M. (1989). Efficient algorithms for dilated mappings of binary trees. Retrieved from http://cn.ebooklibrary.org/


Description
Supplemental catalog subcollection information: NASA Publication Collection; Astrophysics and Technical Documents; The problem is addressed to find a 1-1 mapping of the vertices of a binary tree onto those of a target binary tree such that the son of a no

Summary
Contributor: National Aeronautics and Space Administration (NASA). The digitalization of this book was sponsored by National Aeronautics and Space Administration (NASA); Additional Subject Descriptions: BARS; DELAMINATING; ANISOTROPY; STRESS CONCENTRATION; FINITE ELEMENT METHOD; SANDWICH STRUCTURES; ASPECT RATIO; ELASTIC PROPERTIES; FAILURE ANALYSIS

 
 



Copyright © World Library Foundation. All rights reserved. eBooks from World eBook Library are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.