| dc.contributor.advisor | Sunitha, V. | |
| dc.contributor.author | Srivastava, Abhishek | |
| dc.date.accessioned | 2017-06-10T14:37:36Z | |
| dc.date.available | 2017-06-10T14:37:36Z | |
| dc.date.issued | 2008 | |
| dc.identifier.citation | Srivastava, Abhishek (2008). Embedding binary trees and caterpillars into the hypercube. Dhirubhai Ambani Institute of Information and Communication Technology, vi, 40 p. (Acc.No: T00182) | |
| dc.identifier.uri | http://drsr.daiict.ac.in/handle/123456789/219 | |
| dc.description.abstract | Embedding graphs is an important and well-studied theory in parallel computing. Finding the embedding of trees into hypercubes is an important, interesting and difficult problem. This work studies the embedding of binary trees and caterpillars into hypercubes. We give an embedding for a special type of binary tree into its optimal hypercube. We also present embedding of generalized ladders as subgraph into the hypercube. Through an embedding of caterpillars into generalized ladders, we have obtained an embedding of a class of caterpillars into their optimal hypercube. | |
| dc.publisher | Dhirubhai Ambani Institute of Information and Communication Technology | |
| dc.subject | Parallel processing | |
| dc.subject | Electronic computers | |
| dc.subject | Computer algorithms | |
| dc.subject | Parallel algorithms | |
| dc.subject | Graph theory-Hypercube | |
| dc.subject | Surfaces Algebraic | |
| dc.subject | Algorithms | |
| dc.subject | Computational complexity | |
| dc.classification.ddc | 511.52 SRI | |
| dc.title | Embedding binary trees and caterpillars into the hypercube | |
| dc.type | Dissertation | |
| dc.degree | M. Tech | |
| dc.student.id | 200611035 | |
| dc.accession.number | T00182 | |
