| Title: | Embedding of complete and nearly complete binary trees into hypercubes |
|---|
| Authors: | ID Vesel, Aleksander (Author) |
|---|
| Files: |  http://www.imfm.si/preprinti/PDF/01115.pdf
|
|---|
| Language: | English |
|---|
| Work type: | Not categorized |
|---|
| Organization: | FNM - Faculty of Natural Sciences and Mathematics
|
|---|
| Abstract: | A new simple algorithm for optimal embedding of complete binary trees into hypercubes as well as a node-by-node algorithm for embedding of nearly complete binary trees into hypercubes are presented. |
|---|
| Keywords: | matematika, teorija grafov, vložitev, hiperkocka, algoritem, mathematics, graph theory, embedding, complete binary tree, hypercube, algorithm |
|---|
| Year of publishing: | 2010 |
|---|
| Number of pages: | str. 1-9 |
|---|
| Numbering: | Vol. 48, št. 1115 |
|---|
| PID: | 20.500.12556/DKUM-49386  |
|---|
| ISSN: | 2232-2094 |
|---|
| UDC: | 519.17 |
|---|
| COBISS.SI-ID: | 15519833 |
|---|
| NUK URN: | URN:SI:UM:DK:JX6SWLEV |
|---|
| Publication date in DKUM: | 10.07.2015 |
|---|
| Views: | 1415 |
|---|
| Downloads: | 83 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
