Bisecting de Bruijn and Kautz graphs

DOI10.1016/S0166-218X(98)00031-6zbMath0907.68140MaRDI QIDQ1392548

José D. P. Rolim, Jan Trdlička, Pavel Tvrdík, Imrich Vrt'o

Publication date: 28 July 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

interconnection networkmassively parallel computers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On the design of efficient ATM routing schemes

Cites Work

• On forwarding indices of networks
• The forwarding index of communication networks
• The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
• Applications of a Planar Separator Theorem
• On bandwidth, cutwidth, and quotient graphs
• A better upper bound on the bisection width of de Bruijn networks
• Communication throughput of interconnection networks
• The relationship between gossiping in vertex-disjoint paths mode and bisection width
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bisecting de Bruijn and Kautz graphs