An improved neural network model for the two-page crossing number problem

IEEE Transactions on Neural Networks

Volumn 17, Issue 6, 2006, Pages 1642-1646

  He, Hongmei ^a   Sýkora, Ondrej ^a   Mäkinen, Erkki ^b  

^a LOUGHBOROUGH UNIVERSITY   (United Kingdom)

^b TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

Energy function; Hopfield model; Learning algorithm; Motion equation; Two page crossing number

Indexed keywords

ARTIFICIAL INTELLIGENCE; EQUATIONS OF MOTION; LEARNING ALGORITHMS; MATHEMATICAL MODELS;

CROSSING PROBLEM NUMBER; HOPFIELD MODEL;

NEURAL NETWORKS;

ALGORITHM; ARTIFICIAL NEURAL NETWORK; AUTOMATED PATTERN RECOGNITION; INFORMATION RETRIEVAL; LETTER; METHODOLOGY;

ALGORITHMS; INFORMATION STORAGE AND RETRIEVAL; NEURAL NETWORKS (COMPUTER); PATTERN RECOGNITION, AUTOMATED;

EID: 37849189005     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNN.2006.881486     Document Type: Article

References (18)

1. R. Cimikowski, "Algorithms for the fixed linear crossing number problem," Discrete Appl. Math., vol. 122, pp. 93-115, 2002.
2. R. Cimikowski and P. Shope, "A neural network algorithm for a graph layout problem," IEEE Trans. Neural Netw., vol. 7, no. 2, pp. 341-346, Mar. 1996.
3. R. Fulek, H. He, O. Sýkora, and I. Vrt'o, "Outerplanar crossing numbers of 3-row meshes, halin graphs and complete p-partite graphs," in Proc. SOFSEM'05, 2005, vol. 3381, pp. 376-379.
4. R. K. Guy, Y. Alavi, D. R. Lick, and A. T. White, Eds., "Crossing number of graphs," in Proc. Conf. Graph Theory Applicat., Kalamazoo, MI, 1972, pp. 111-124.
5. H. He, O. Sýkora, and I. Vrt'o, "Heuristic crossing minimization algorithms for the 2-page drawings," in ACMJ. Experimental Algorithmics, submitted for publication.
6. M. W. Hirsch, "Convergent activation dynamics in continuous time networks," in Proc. Nat. Acad. Sci., 1989, vol. 2, pp. 331-349.
7. J. Hopfield, "Neural networks and physical systems with emergent collective computational abilities," Neural Netw., vol. 79, pp. 2554-2558, 1982.
8. J. Hopfield and D. Tank, "Neural computation of decisions in optimization problems," Biol. Cybern., vol. 52, pp. 141-152, 1985.
9. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. San Mateo, CA: Morgan Kaufmann, 1992.
10. S. Masuda, T. Kashiwabara, K. Nakajima, and T. Fujisawa, "Crossing minimization in linear embeddings of graphs," IEEE Trans. Comput., vol. 39, no. 1, pp. 124-127, Jan. 1990.
11. W. S. McCulloch and W. Pitts, "A logical calculus of the ideas immanent in nervous activity," Bull. Math. Biophys., vol. 5, pp. 115-133, 1943.
12. A. Sen, A. Sengupta, and S. Bandyopadhyay, "On some topological properties of hypercubes, incomplete hypercubes, and supercubes," in Proc. 7th Int. Parallel Process. Symp., Newport Beach, CA, 1993, pp. 636-642.
13. F. Shahrokhi, O. Sýkora, L. Székely, and I. Vrt'o, "The book crossing number of a graph," J. Graph Theory, vol. 21, pp. 413-424, 1996.
14. Y. Takefuji, "Design of parallel distributed Cauchy machines," in Proc. Int. Joint Conf. Neural Netw., 1989, pp. 529-536.
15. Y. Takefuji, "Design of parallel distributed Cauchy machines," in Neural Network Parallel Computing. Boston, MA: Kluwer, 1992.
16. Y. Takefuji and K. C. Lee, "A near-optimum parallel planarization algorithm," Science, vol. 245, pp. 1221-1223, 1989.
17. R. L. Wang and K. Okazaki, "An efficient parallel algorithm for the minimum crossing number problem," Neurocomput., vol. 67, pp. 411-416, 2005.
18. J. Wiedermann, "Complexity issues in discrete neurocomputing," in Proc. IMYCS'90, 1990, vol. 464, pp. 93-108.