<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=49386"><dc:title>Embedding of complete and nearly complete binary trees into hypercubes</dc:title><dc:creator>Vesel,	Aleksander	(Avtor)
	</dc:creator><dc:subject>matematika</dc:subject><dc:subject>teorija grafov</dc:subject><dc:subject>vložitev</dc:subject><dc:subject>hiperkocka</dc:subject><dc:subject>algoritem</dc:subject><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>embedding</dc:subject><dc:subject>complete binary tree</dc:subject><dc:subject>hypercube</dc:subject><dc:subject>algorithm</dc:subject><dc:subject/><dc:description>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.</dc:description><dc:date>2010</dc:date><dc:date>2015-07-10 12:02:05</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>49386</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>