Edge crossing minimisation using artificial neural networks

被引：2

作者：

Tambouratzis, T ^{[1
]}

机构：

[1] NCSR Demokritos, Inst Nucl Technol Radiat Protect, Athens 15310, Greece

来源：

关键词：

neural networks; VLSI;

D O I：

10.1049/el:19971060

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

An artificial neural network is proposed for solving the NP-complete problem of edge crossing minimisation optimally and in parallel.

引用

页码：1621 / 1623

页数：3

共 5 条

[1] AUTOMATIC DISPLAY OF HIERARCHIZED GRAPHS FOR COMPUTER-AIDED DECISION-ANALYSIS
CARPANO, MJ
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1980, 10 (11): : 705 - 715
[2] THE ASSIGNMENT HEURISTIC FOR CROSSING REDUCTION
CATARCI, T
[J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1995, 25 (03): : 515 - 521
[3] CROSSING NUMBER IS NP-COMPLETE
GAREY, MR
JOHNSON, DS
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1983, 4 (03): : 312 - 316
[4] NEW LOWER BOUND TECHNIQUES FOR VLSI
LEIGHTON, FT
[J]. MATHEMATICAL SYSTEMS THEORY, 1984, 17 (01): : 47 - 70
[5] Smolensky P., 1986, Information processing in dynamical systems: Foundations of harmony theory, P194