An efficient parallel algorithm for the minimum crossing number problem

Neurocomputing

Volumn 67, Issue 1-4 SUPPL., 2005, Pages 411-416

  Wang, Rong Long ^a   Okazaki, Kozo ^a  

^a UNIVERSITY OF FUKUI   (Japan)

Author keywords

Hopfield neural network; Internal dynamics; Minimum crossing number problem; NP complete problem

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; NEURAL NETWORKS; NUMBER THEORY; PROBABILITY; PROBLEM SOLVING;

HOPFIELD NEURAL NETWORK; LOCAL MINIMA; MINIMUM CROSSING NUMBER PROBLEM;

PARALLEL ALGORITHMS;

ACCURACY; ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; ARTIFICIAL NEURAL NETWORK; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MATHEMATICAL PARAMETERS; NERVE CELL MEMBRANE POTENTIAL; NONLINEAR SYSTEM; PARALLEL DESIGN; PRIORITY JOURNAL; PROBABILITY; PROBLEM SOLVING; SIMULATION; STEADY STATE;

EID: 21744436666     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2004.09.005     Document Type: Article

References (7)

1. S.N. Bhatt F.T. Leighton A framework for solving VLSI graph layout problem J. Comput. System Sci. 28 2 1984 300-343
2. R. Cimikowski P. Shope A neural network algorithm for a graph layout problem IEEE Trans. Neural Network 7 2 1996 341-345
3. M.R. Garey D.S. Johnson Crossing number is NP-complete SIAM J. Algebraic Discrete Methods 4 3 1983 312-316
4. J.J. Hopfield Neurons with graded response have collective computational properties like those of two-state neurons Proc. Natl. Acad. Sci. USA 81 1984 3088-3092
5. J.J. Hopfield D.W. Tank 'Neural' computation of decisions in optimization problems Biol. Cybernet. 52 1985 141-152
6. F. Shahrokhi L.A. Szekely O. Sykora I. Vrto The book crossing number of a graph J. Graph Theory 21 4 1996 413-424
7. G.V. Wilson G.S. Pawley On the stability of the traveling salesman problem algorithm of Hopfield and Tank Biol. Cybernet. 58 1 1988 63-70