Optimal emulations by butterfly-like networks

DOI10.1145/226643.226658zbMath0882.68006OpenAlexW2008773589MaRDI QIDQ4371672

B. Obrenić, Jia-Wei Hong, Eric J. Schwabe, Sandeep N. Bhatt, Arnold L. Rosenberg, Fan R. K. Chung, Frank Thompson Leighton

Publication date: 21 January 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1996-43/

zbMATH Keywords

combinatorial algorithmsnonnumerical algorithmsbutterfly-like networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (5)

An approach to emulating separable graphs ⋮ Real-time emulations of bounded-degree networks ⋮ Cycles in butterfly graphs ⋮ Minimum spanners of butterfly graphs ⋮ Product-shuffle networks: Toward reconciling shuffles and butterflies

This page was built for publication: Optimal emulations by butterfly-like networks