Bisection width of transposition graphs

Discrete Applied Mathematics

Volumn 84, Issue 1-3, 1998, Pages 221-235

  Stacho, Ladislav ^a   Vrt'O, Imrich ^a  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042359012     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00009-2     Document Type: Article

References (20)

1. S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: an attractive alternative to the n-cube., in: Proc. Internat. Conf. on Parallel Processing, IEEE Computer Society Press, Silver Spring, MD, 1987, pp. 393-400.
2. F.R.K. Chung, Labelings of graphs, In: W.Beineke, (Ed.), Graph Theory, vol. 3, Academic Press, New York, 1988, pp. 152-167.
3. P. Erdös, R.P. Guy, Crossing number problems, Amer. Math. Mon. 80 (1973), pp. 52-58.
4. J.M. Hammersley, The sum of products of the natural numbers, Proc. London Math. Soc. 3 (1952), 435-452.
5. L.H. Harper, Optimal numberings and isoperimetric problems on graphs, J. Combin. Theory 1 (1966), 385-393.
6. M.R. Jerrum, The complexity of finding minimum-length generator sequences, Theoret. Comput. Sci. 36 (1985), 265-289.
7. V.L. Kompel'makher, A.V. Liskovets, Sequential generation of arrangements by means of a basis of transpositions, Kibernetica 3 (1975), 17-21.
8. L.S. Lakshmivarahan, Jwo Jung-Sing, S.K. Dall, Symmetry in interconnection networks based on Cayley graphs of permutation groups: a survey, Parallel Comput. 19 (1993), 361-407.
9. F.T. Leighton, Complexity Issues in VLSI, MIT Press, Cambridge, 1983.
10. F.T. Leighton, Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann, San Mateo, 1992.
11. C.E. Leiserson, Area efficient graph layouts (for VLSI), in: Proc. 21-st Annual IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1980, pp. 270-281.
12. R.J. Lipton, R.E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math. 36 (1979), pp. 177-189.
13. W.F. McColl, Special purpose parallel computing, In: A. Gibbons, P. Spirakis, (Eds.), Lectures on Parallel Computations, Cambridge University Press, Cambridge, 1993, pp. 261-311.
14. J. Riordan, An Introduction to Combinatorial Analysis, Wiley, New York, 1958.
15. A. Rosa, J. Širáň, Š. Znám, The graph of all labelings of a connected graph is hamiltonian, Technical Report, Department of Mathematics and Statistics, McMaster University, 1990.
16. A.L. Rosenberg, Graph embedding 1988, recent breakthrough, new directions, in: Proc. 3rd Aegean Workshop on Computing, Lecture Notes in Computer Science, vol. 319, Springer, Berlin, 1988, pp. 169-179.
17. F. Shahrokhi, L.A. Székely, An algebraic approach to the uniform concurrent multicommodity flow problem: theory and applications, Technical Report CRPDC-91-4, Department of Computer Science, University of North Texas, Denton, 1991.
18. F. Shahrokhi, L.A. Székely, I. Vrt'o, Crossing numbers of graphs, lower bound techniques and algorithms, in: Proc. Graph Drawing, Lecture Notes in Computer Science, vol. 894, Springer, Berlin, 1995, pp. 131-142.
19. O. Sýkora, I. Vrt'o, On the VLSI layout of the star graph and related networks, Integration VLSI J. 17 (1994), 83-93.
20. C.D. Thompson, Area-time complexity for VLSI, in: Proc. 11th Annu. Symp. on Theory of Computing, ACM Press, New York, 1979, pp. 81-88.