Efficient Dynamic Embeddings of Binary Trees into Hypercubes

DOI10.1006/JAGM.2002.1218zbMATH Open1005.68111OpenAlexW1965088527MaRDI QIDQ3150271FDOQ3150271

Authors: Volker Heun, Ernst W. Mayr 

Publication date: 30 September 2002

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2002.1218

Recommendations

• Optimal dynamic embeddings of complete binary trees into hypercubes
• scientific article; zbMATH DE number 1161316
• Publication:4862246
• A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
• scientific article; zbMATH DE number 4064517

zbMATH Keywords

binary treeshypercubesdynamically embedding

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cited In (8)

• Compact embedding of binary trees into hypercubes
• Optimal dynamic embedding of X-trees into arrays
• A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
• Taking random walks to grow trees in hypercubes
• Title not available (Why is that?)
• Optimal dynamic embeddings of complete binary trees into hypercubes
• The minimum spectral radius of an edge-removed network: a hypercube perspective
• A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES

This page was built for publication: Efficient Dynamic Embeddings of Binary Trees into Hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3150271)