Edge crossing minimisation using artificial neural networks

Electronics Letters

Volumn 33, Issue 19, 1997, Pages 1621-1623

  Tambouratzis, T ^a  

^a NONE

Author keywords

Neural networks; VLSI

Indexed keywords

COMPUTATIONAL COMPLEXITY; NEURAL NETWORKS; PROBLEM SOLVING;

EDGE CROSSING MINIMIZATION;

VLSI CIRCUITS;

EID: 0031235085     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19971060     Document Type: Article

References (5)

1. LEIGHTON, F.T.: 'New lower bound techniques for VLSI', Math. Syst., 1984, 17, pp. 47-70
2. GAREY, M.R., and JOHNSON, D.S.: 'Crossing number is NP-complete', SIAM J. Algebr. Discrete Methods, 1983, 4, pp. 312-316
3. CARPANO, M.J.: 'Automatic display of hierarchized graphs for computer-aided decision analysis', IEEE Trans. Syst., Man Cybern., 1980, 10, pp. 705-715
4. CATARZI, T.: 'The assignment heuristic for crossing minimisation', IEEE Trans. Syst., Man Cybern., 1995, 25, pp. 515-521
5. SMOLENSKY, P., Information processing in dynamical systems: foundations of harmony theory, in RLIMELHART, D.E., and MCCLELLAND, J.L. (Eds): 'Parallel distributed processing: explorations in the microstructure of cognition (Vol. 1: Foundations)' (MIT Press, Cambridge MA, 1986) pp.194-281