A better upper bound on the bisection width of de Bruijn networks (extended abstract)

DOI10.1007/BFB0023485MaRDI QIDQ5048950zbMATH OpenOpenAlexFDO

Authors Rainer Feldmann, Burkhard Monien, P. Mysliwietz, Stefan Tschöke

Publication date 9 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0023485

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Bisecting de Bruijn and Kautz graphs
• scientific article; zbMATH DE number 176141
• On bandwidth, cutwidth, and quotient graphs
• On the bisection width and expansion of butterfly networks
• Cutwidth of the de Bruijn graph

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 176141 (Why is no real title available?)
• scientific article; zbMATH DE number 828046 (Why is no real title available?)
• Generalized Fibonacci Numbers and Associated Matrices
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI

Cited in

(7)

• On the bisection width and expansion of butterfly networks
• Some VLSI decompositions of the de Bruijn graph
• On the design of efficient ATM routing schemes
• Bisection (band)width of product networks with application to data centers
• Bisecting de Bruijn and Kautz graphs
• On the bisection width of the transposition network
• Partitioning through projections: strong SDP bounds for large graph partition problems

This page was built for publication: A better upper bound on the bisection width of de Bruijn networks (extended abstract)

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