Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
For students
For employees
Statistics
Login
First page
>
Show document
Show document
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:
1222
Downloads:
49
Metadata:
Categories:
Misc.
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
VESEL, Aleksander, 2010,
Embedding of complete and nearly complete binary trees into hypercubes
[online]. 2010. [Accessed 30 March 2025]. Retrieved from: http://www.imfm.si/preprinti/PDF/01115.pdf
Copy citation
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Searching for similar works...
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
