Skip to content

Opening book details…

Can I read Bisection Width of Transposition Graphs on EtoBox?

Bisection Width of Transposition Graphs by Ladislav Stacho; Imrich Vrt'o is a Computer Science article available to read on EtoBox.

What is Bisection Width of Transposition Graphs about?

We prove lower and upper bounds on bisection width of transposition graphs. This class of graphs contains several frequently studied interconnection networks including star graphs and hypercubes. In particular, we prove that the bisection width of the complete transposition graph is of order O(n.n!) which solves the open problem (R) 3.356 of Leighton's book [IO] and determine an asymptotically exact value of bisection width of the star graph. The results have applications to VLSI layouts, cutwidth and crossing numbers of transposition graphs. We also study bandwidth of these graphs.

Who reads Bisection Width of Transposition Graphs?

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Ladislav Stacho; Imrich Vrt'o
Publisher
Elsevier Science; Elsevier ; Elsevier BV (ISSN 0166-218X)
Published
1998
Language
EN
Field
Computer Science (Physical Sciences)

More by Ladislav Stacho; Imrich Vrt'o

Browse all works by Ladislav Stacho; Imrich Vrt'o