On embedding subclasses of height-balanced trees in hypercubes (Q1006750): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2009.01.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086721427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Balanced Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving efficiently the 0-1 multi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding height balanced trees and Fibonacci trees in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding a family of disjoint 3D meshes into a crossed cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense sets and embedding binary trees into hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding meshes into crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete path embeddings in crossed cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest fault-free paths in hypercubes with vertex faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian circuits and spanning trees of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding the dichotomic tree into the $n$-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-legged caterpillars span hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing vertex-disjoint paths in \((n, k)\)-star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel dictionaries using AVL trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient unbalanced merge-sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cubes and dichotomic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-disjoint paths in hierarchical hypercube networks / rank
 
Normal rank

Latest revision as of 05:18, 29 June 2024

scientific article
Language Label Description Also known as
English
On embedding subclasses of height-balanced trees in hypercubes
scientific article

    Statements

    On embedding subclasses of height-balanced trees in hypercubes (English)
    0 references
    25 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    interconnection network
    0 references
    hypercube
    0 references
    parallel algorithm
    0 references
    height-balanced tree
    0 references
    embedding
    0 references
    dilation
    0 references
    0 references
    0 references
    0 references