메뉴 건너뛰기




Volumn 7, Issue 2, 1996, Pages 341-345

A neural-network algorithm for a graph layout problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; COMPUTER SIMULATION; GRAPH THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PARALLEL ALGORITHMS; PROBLEM SOLVING; TESTING;

EID: 0030108741     PISSN: 10459227     EISSN: None     Source Type: Journal    
DOI: 10.1109/72.485670     Document Type: Article
Times cited : (38)

References (15)
  • 1
    • 0000348622 scopus 로고
    • Crossing number is NP-complete
    • M. R. Garey and D. S. Johnson, "Crossing number is NP-complete," SIAM J. Alg. Disc. Meth., vol. 4, no. 3, pp. 312-316, 1983.
    • (1983) SIAM J. Alg. Disc. Meth. , vol.4 , Issue.3 , pp. 312-316
    • Garey, M.R.1    Johnson, D.S.2
  • 2
    • 0010242021 scopus 로고
    • Crossing number of graphs
    • New York: Springer-Verlag
    • R. K. Guy, "Crossing number of graphs," in Graph Theory and Applications. New York: Springer-Verlag, 1972.
    • (1972) Graph Theory and Applications
    • Guy, R.K.1
  • 3
    • 0003780715 scopus 로고
    • Reading, MA: Addison-Wesley
    • F. Harary, Graph Theory. Reading, MA: Addison-Wesley, 1969.
    • (1969) Graph Theory
    • Harary, F.1
  • 4
    • 0021835689 scopus 로고
    • Neural computation of decisions in optimization problems
    • J. Hopfield and D. Tank, "Neural computation of decisions in optimization problems," Biol. Cybern., vol. 52, pp. 141-152, 1985.
    • (1985) Biol. Cybern. , vol.52 , pp. 141-152
    • Hopfield, J.1    Tank, D.2
  • 6
    • 0026628404 scopus 로고
    • A parallel improvement algorithm for the bipartite subgraph problem
    • K.-C. Lee, N. Funabiki, and Y. Takefuji, "A parallel improvement algorithm for the bipartite subgraph problem," IEEE Trans. Neural Networks, vol. 3, no. 1, pp. 139-145, 1992.
    • (1992) IEEE Trans. Neural Networks , vol.3 , Issue.1 , pp. 139-145
    • Lee, K.-C.1    Funabiki, N.2    Takefuji, Y.3
  • 7
    • 0002621814 scopus 로고
    • New lower hound techniques for VLSI
    • F. T. Leighton, "New lower hound techniques for VLSI," Math. Syst. Theory, vol. 17, pp. 47-70, 1984.
    • (1984) Math. Syst. Theory , vol.17 , pp. 47-70
    • Leighton, F.T.1
  • 8
    • 51249194645 scopus 로고
    • A logical calculus of ideas imminent in nervous activity
    • W. S. McCulloch and W. H. Pitts, "A logical calculus of ideas imminent in nervous activity," Bullet. Math. Biophys., vol. 5, pp. 115-133, 1943.
    • (1943) Bullet. Math. Biophys. , vol.5 , pp. 115-133
    • McCulloch, W.S.1    Pitts, W.H.2
  • 9
    • 33645699608 scopus 로고
    • Permutation procedure for minimizing the number of crossings in a network
    • T. A. J. Nicholson, "Permutation procedure for minimizing the number of crossings in a network," Proc. IEE, vol. 115, no. 1, pp. 21-26, 1968.
    • (1968) Proc. IEE , vol.115 , Issue.1 , pp. 21-26
    • Nicholson, T.A.J.1
  • 10
    • 0001693878 scopus 로고
    • The traveling salesman problem: A neural-network perspective
    • J.-Y. Potvin, "The traveling salesman problem: A neural-network perspective," ORSA J. Comput., vol. 5, no. 4, pp. 328-348, 1993.
    • (1993) ORSA J. Comput. , vol.5 , Issue.4 , pp. 328-348
    • Potvin, J.-Y.1
  • 11
    • 0000326269 scopus 로고
    • Topology of thin film circuits
    • F. W. Sinden, "Topology of thin film circuits," Bell Syst. Tech. J., vol. XLV, pp. 1639-1666, 1966.
    • (1966) Bell Syst. Tech. J. , vol.45 , pp. 1639-1666
    • Sinden, F.W.1
  • 12
  • 14
    • 0037648004 scopus 로고
    • A near-optimum parallel planarization algorithm
    • Y. Takefuji and K.-C. Lee, "A near-optimum parallel planarization algorithm," Sci., vol. 245, pp. 1221-1223, 1989.
    • (1989) Sci. , vol.245 , pp. 1221-1223
    • Takefuji, Y.1    Lee, K.-C.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.