REFERENCES
- S Roy, S Bandyopadhyay & U Maulik. Proof Regarding the NP completeness completeness of the Unweighted Complex Triangle Elimination Problem for General Adjacency graphs. IEE Proceedings: Computers and Digital Techniques, vol 148, No 6, pp 238–244, Nov 2001.
- Lengauer, Combinational Algorithms for Integrated Circuits, John Wiley and Sons, New York, 1990.
- J Bhaskar & S Sahni, A linear algorithm to find a rectangular dual of a planer triangulated graph, in Proc of 23rd Design Automation Conference, 1986.
- K Kozminski & E Kinnen, Rectangular dual of planner graphs. Networks, 15, pp 145–157, 1985.
- S Micali & V V Vazirani, An O((IVI)½(IEI)) algorithm for finding maximum matching in general graphs, in Proc of 21st Annual Symposium on the Foundations of Computer Science, pp 17–22, IEEE, 1980.
- Y Sun & M Sarrafzadeh, Floor planning by graph dualization: L-shaped Models, in hit Symposium on Circuits and Systems, pp 2845–2848, IEEE, 1990.
- K-H Yeap & M Sarrafzadeh, Floor planning by graph dualization: 2-concave rectilinear modules, SIAM J. COM PUT, vol 22, no 3, pp 500–526, 1993.
- K Kozminski & E Kinnen, Rectangular dualization and Rectangular dissection, IEEE Trans Circuits and Systems, vol 35, pp 1401–1416, 1988.
- Garey K H Yeap & Majid Sarrafzadeh, Sliceable floor- planning by graph dualization, SIAM J DISC MATH, vol 8, no 2, pp 258–280, 1995.
- K-H Yeap & M Sarrafzadeh, A theorem of sliceability, 2nd Great Lakes Computer Science Conference, Western Michigan Univ. Kalamazoo, MI, 1991.
- Y Sun & K-l I Yeap, Edge Covering of Complex Triangle in Rectangular Dual Floorplanning, in Journals of Circuit, System and computers, 1993.
- E Rich & K Knight, Artificial Intelligence, Tata-McGraw Hill, ND, 1991.
- S Kirkpatrick, C DGelatt & M P Vecchi, Optimization Using Simulated Annealing, Science, 220 (4598), 1983.
- L Ingber. Adaptive Simulated Annealing (ASA). Technical report, Lester Ingber Research, McLean, VA, 1993.
- S Kirkpatrik & G B Sorkin, Simulated Anealing, In Michael A. Arbib, editor, The handbook of lirain Theory and Neural Networks, MIT Press, Cambridge Massachusetts, pp 876–878, 1995.