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;algoritem;mathematics;graph theory;embedding;binary trees;algorithm;

Data

Language:	English
Year of publishing:	2011
Typology:	1.08 - Published Scientific Conference Contribution
Organization:	UM FNM - Faculty of Natural Sciences and Mathematics
UDC:	519.17
COBISS:	18843656
Parent publication:	MATCOS-10
Views:	1229
Downloads:	37
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary keywords:	matematika;teorija grafov;vložitev;algoritem;
URN:	URN:SI:UM:
Pages:	Str. 57-60
ID:	8723804