A better upper bound on the bisection width of de Bruijn networks
From MaRDI portal
Publication:5048950
DOI10.1007/BFb0023485zbMath1498.68203MaRDI QIDQ5048950
Stefan Tschöke, Burkhard Monien, Rainer Feldmann, P. Mysliwietz
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
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
On the design of efficient ATM routing schemes, Partitioning through projections: strong SDP bounds for large graph partition problems, Bisecting de Bruijn and Kautz graphs
Cites Work