Spanning Balanced Trees in Boolean Cubes

DOI10.1137/0910038zbMath0678.68013OpenAlexW2055434708MaRDI QIDQ3835004

Ching-Tien Ho, S. Lennart Johnsson

Publication date: 1989

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0910038

zbMATH Keywords

periodicityspanning treeroutingbalancednecklacesshufflesBoolean cubespersonalized communication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (2)

Methods and problems of communication in usual networks ⋮ Routing multiple paths in hypercubes

This page was built for publication: Spanning Balanced Trees in Boolean Cubes