scientific article; zbMATH DE number 1161316

MaRDI QIDQ4393310zbMATH OpenFDO

Authors Ömer Eğecioğlu, Maximilian Ibel

Publication date 8 June 1998

zbMATH Keywords

dynamically growing treeshypercubes

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Efficient Dynamic Embeddings of Binary Trees into Hypercubes
• Embedding of \(k\)-ary complete trees into hypercubes with uniform load
• Optimal dynamic embeddings of complete binary trees into hypercubes
• A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
• Efficient embeddings of ternary trees into hypercubes.

Cited in

(8)

• Embedding of \(k\)-ary complete trees into hypercubes with uniform load
• Trees, not cubes: Hypercontractivity, cosiness, and noise stability
• Analysis of randomized load distribution for reproduction trees in linear arrays and rings
• On thek-ary hypercube tree and its average distance
• Taking random walks to grow trees in hypercubes
• Efficient Dynamic Embeddings of Binary Trees into Hypercubes
• A METHOD FOR EVALUATING THE EXPECTED LOAD OF DYNAMIC TREE EMBEDDINGS IN HYPERCUBES
• Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks

This page was built for publication:

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