Bisection width of transposition graphs
From MaRDI portal
Publication:1392578
DOI10.1016/S0166-218X(98)00009-2zbMath0902.68148MaRDI QIDQ1392578
Publication date: 10 December 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
05C35: Extremal problems in graph theory
90B18: Communication networks in operations research
68R10: Graph theory (including graph drawing) in computer science
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
Related Items
On randomized broadcasting in star graphs, Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of finding minimum-length generator sequences
- Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
- A Separator Theorem for Planar Graphs
- On VLSI layouts of the star graph and related networks
- Optimal numberings and isoperimetric problems on graphs
- Crossing Number Problems
- The Sums of Products of the Natural Numbers