On a solution of a randomized three tracks variant of the Gate Matrix Layout problem

Discrete Mathematics

Volumn 236, Issue 1-3, 2001, Pages 179-189

  Karoński, Michał ^a,b   Szymkowiak, Magdalena ^c  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

^b EMORY UNIVERSITY   (United States)

^c NONE

Author keywords

Boolean matrix; Forbidden bipartite generator; Forbidden intersection graph; k Gate Matrix Layout; Random Boolean matrix; Subgraph threshold

Indexed keywords

EID: 0035815963     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00441-6     Document Type: Article

References (17)

1. T. Bagchi, S. Das, An efficient Hybrid Heuristic for Gate Matrix Layout, Technical Report CRPDC-92-15, Center for Research in Parallel and Distributed Computing, Department of Computer Sciences, University of North Texas, September 1992.
2. R.L. Bryant, M.R. Fellows, N.G. Kinnersley, M.A. Langston, On finding obstruction sets and polynomial-time algorithms for gate matrix layout, Proceedings of the 25th Allerton Conference on Communication, Control and Computing, 1987, pp. 397-398.
3. S. Das, N. Deo, S. Prasad, Gate Matrix Layout Revisited: Algorithmic Performance and Probabilistic Analysis, Lecture Notes in Computer Science, Vol. 405, Springer, Heidelberg 1989, pp. 280-290.
4. N. Deo, M.S. Krishnamoorthy, M.A. Langston, Exact and approximate solution for the gate matrix layout problem, IEEE Trans. Comput.-Aided Design 6 (1987) 79-84.
5. M.R. Fellows, M.A. Langston, Nonconstructive advances in polynomial-time complexity, Inform. Process Lett. 26 (1987) 157-162.
6. M.R. Fellows, M.A. Langston, Nonconstructive tools for providing polynomial-time decidability, J. Assoc. Comput. Math. 35 (1988) 727-739.
7. M.R. Fellows, M.A. Langston, On well-partial-order theory and its application to combinatorial problems of VLSI design, SIAM J. Discrete Math. 5 (1992) 117-126.
8. M.R. Fallows, M.A. Langston, On search, decision and the efficiency of polynomial-time algorithms, Proceedings of the 21st ACM Symposium on the Theory of Computing, 1989, pp. 501-512.
9. M. Karoński, Random Graphs, in: R.L. Graham, M. Grötschel, L. Lovász (Eds.), Handbook of Combinatorics, Vol. 1, Elsevier, Amsterdam, 1995, pp. 351-380.
10. M. Karoński, A. Ruciński, Small subgraphs of k-partite random graphs, Combinatorial Mathematics: Proceedings of the Third International Conference, New York Academy of Sciences, New York, 1985, Vol. 555, 1989, pp. 230-240.
11. M. Karoński, E.R. Sheinerman, K.B. Singer, On Random Intersection Graphs: The Subgraph Problem, in Combinatorics, Probability and Computing 8 (1999) 131-159.
12. T. Kashwabara, T. Fujisawa, An NP-complete problem on interval graphs, Proceedings of IEEE Symposium on Circuits and Systems, 1979, pp. 82-83.
13. N.G. Kinnersley, Obstruction set isolation for layout permutation problems, Ph.D. Thesis, Washington State University, 1989.
14. N.G. Kinnersley, M.A. Langston, Obstruction set isolation for the gate matrix layout problem, Discrete Appl. Math. 54 (1994) 169-213.
15. N. Robertson, P.D. Seymour, I. Graph minors, Excluding a forest, J. Combin. Theory Ser. B 35 (1983) 39-61.
16. N. Robertson, P.D. Seymour, V. Graph minors, Excluding a planar graph, J. Combin. Theory Ser. B 41 (1986) 92-114.
17. K. Singer, Random intersection graphs, Ph.D. Thesis, Johns Hopkins University, 1995.