-
1
-
-
0000348622
-
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
-
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
-
-
Reading, MA: Addison-Wesley
-
F. Harary, Graph Theory. Reading, MA: Addison-Wesley, 1969.
-
(1969)
Graph Theory
-
-
Harary, F.1
-
4
-
-
0021835689
-
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
-
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
-
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
-
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
-
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
-
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
-
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
-
-
0024921358
-
Design of parallel distributed Cauchy machines
-
Y. Takefuji, "Design of parallel distributed Cauchy machines," in Proc. Int. Joint Conf. Neural Networks, 1989, pp. 529-536.
-
(1989)
Proc. Int. Joint Conf. Neural Networks
, pp. 529-536
-
-
Takefuji, Y.1
-
14
-
-
0037648004
-
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
-
15
-
-
0023843418
-
Automatic graph drawing and readability of diagrams
-
R. Tamassia, G. Di Battista, and C. Batini, "Automatic graph drawing and readability of diagrams," IEEE Trans. Syst., Man, Cybern., vol. SMC-18, pp. 61-79, 1988.
-
(1988)
IEEE Trans. Syst., Man, Cybern.
, vol.SMC-18
, pp. 61-79
-
-
Tamassia, R.1
Di Battista, G.2
Batini, C.3
|