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

DOI10.1007/BFB0023485zbMATH Open1498.68203OpenAlexW1867702277MaRDI QIDQ5048950FDOQ5048950

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

Recommendations

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

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)

Cites Work

• Title not available (Why is that?)
• Generalized Fibonacci Numbers and Associated Matrices
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• On the bisection width of the transposition network
• Bisecting de Bruijn and Kautz graphs
• On the bisection width and expansion of butterfly networks
• On the design of efficient ATM routing schemes
• Some VLSI decompositions of the de Bruijn graph
• Bisection (band)width of product networks with application to data centers
• 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)