On the Mapping Problem
Bokhari · IEEE Transactions on Computers · 1981
In array processors it is important to map problem modules onto processors such that modules that communicate with each other lie, as far as possible, on adjacent processors. This mapping problem is formulated in graph theoretic terms and shown to be equivalent, in its most general form, to the graph isomorphism problem. The problem is also very similar to the bandwidth reduction problem for sparse matrices and to the quadratic assignment problem.
Cited by 586 works. doi:10.1109/tc.1981.1675756
Authors
References
- Graph theory with applications to engineering and computer science
- A Review of the Placement and Quadratic Assignment Problems
- Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
- The graph isomorphism disease
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
- GRAPH THEORY AND GAUSSIAN ELIMINATION
- A Special Purpose Architecture for Finite Element Analysis
- Linear time algorithm for isomorphism of planar graphs.
- Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
- Several Strategies for Reducing the Bandwidth of Matrices