Tine Šukljan (Author)

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

succinct;data structures;

Data

Language: English
Year of publishing:
Typology: 1.08 - Published Scientific Conference Contribution
Organization: UP - University of Primorska
UDC: 004
COBISS: 1024519508 Link will open in a new window
Parent publication: MATCOS-10
Views: 3731
Downloads: 78
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: Unknown
Type (COBISS): Not categorized
Pages: Str. 5-8
Keywords (UDC): science and knowledge;organization;computer science;information;documentation;librarianship;institutions;publications;znanost in znanje;organizacije;informacije;dokumentacija;bibliotekarstvo;institucije;publikacije;prolegomena;fundamentals of knowledge and culture;propaedeutics;prolegomena;splošne osnove znanosti in kulture;computer science and technology;computing;data processing;računalniška znanost in tehnologija;računalništvo;obdelava podatkov;
ID: 20449
Recommended works:
, no subtitle data available
, 23rd international symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012
, logic, algorithms, applications
, diplomsko delo univerzitetnega študija
, diplomsko delo