On the Mapping Problem

IEEE Transactions on Computers

Volumn C-30, Issue 3, 1981, Pages 207-214

  Bokhari, Shahid H ^a  

^a UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Pakistan)

Author keywords

Adjacency matrices; array processing; assignment; computer networks; distributed processors; finite element machine; graph isomorphism; heuristic algorithm; mapping problem; pairwise interchange

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0019544910     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1981.1675756     Document Type: Article

References (12)

1. N. Deo, Graph Theory with Applications to Engineering and Computer Science. Englewood Cliffs, NJ: Prentice-Hall, 1974.
2. R. M. Karp, “Probabilistic analysis of a canonical numbering algorithm for graphs,” in Relations Between Combinatorics and Other Parts of Mathematics, Proc. Symp. Pure Math., vol. 24. Providence, RI: American Math. Soc., 1979, pp. 365–378.
3. D. Corneil and R. C. Read,.“The graph isomorphism disease,” J. Graph Theory, vol. 1, no. 4, pp. 339–363, Winter 1977.
4. J. E. Hopcroft and J. K. Wong, “Linear time algorithm for isomorphism of planar graphs,” in Proc. 6th. Annu. Symp. on the Theory of Comput., 1974, pp. 172–184.
5. G. S. Leuker and K. S. Booth, “A linear time algorithm for deciding interval graph isomorphism,” J. Ass. Comput. Mach., vol. 26, pp. 183–185, Apr. 1929.
6. E. Cuthill, “Several strategies for reducing the bandwidth of matrices,” in Sparse Matrices and their Applications, Rose and Willoughby, Eds. New York: Plenum, 1972, pp. 157–166.
7. R. E. Tarjan, “Graph theory and Gaussian elimination,” in Sparse Matrix Computations, Bunch and Rose, Eds. New York: Plenum, 1976, pp. 3–22.
8. N. E. Gibbs, W. G. Poole, and P. K. Stockmeyer, “An algorithm for reducing the bandwidth and profile of a sparse matrix,” SIAMJ. Numerical Anal., vol. 13, pp. 236–250, Apr. 1976.
9. M. Hannan and J. M. Kurtzberg, “A review of the placement and quadratic assignment problems,” SIAM Rev., vol. 14, pp. 324–342, Apr. 1972.
10. H. Jordan, “A special purpose architecture for finite element analysis,” in Proc. 1978 Conf. on Parallel Processing, Aug. 1978, pp. 263–266.
11. H. Jordan, M. Scalabrin, and W. Calvert, “A comparison of three types of multiprocessor algorithms,” in Proc. 1979 Conf. on Parallel Processing, Aug. 1979.
12. H. Jordan. Dersonal communication.