Embedding of complete and nearly complete binary trees into hypercubes

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;

Data

Language:	English
Year of publishing:	2010
Typology:	0 - Not set
Organization:	UM FNM - Faculty of Natural Sciences and Mathematics
UDC:	519.17
COBISS:	15519833
ISSN:	2232-2094
Parent publication:	Preprint series
Views:	0
Downloads:	0
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	Unknown
URN:	URN:SI:UM:
Type (COBISS):	Not categorized
Pages:	str. 1-9
Volume:	ǂVol. ǂ48
Issue:	ǂšt. ǂ1115
Chronology:	2010
ID:	68330