-
1
-
-
0022808049
-
Finding a maximum clique in an arbitrary graph
-
E. Balas and C.S. Yu. Finding a maximum clique in an arbitrary graph. SIAM Journal of Computing, 15(4):1054–1068, 1986.
-
(1986)
SIAM Journal of Computing
, vol.15
, Issue.4
, pp. 1054-1068
-
-
Balas, E.1
Yu, C.S.2
-
2
-
-
0002590155
-
The maximum clique problem
-
D.-Z. Du and P.M. Pardalos, editors, Kluwer Academic Publishers, Boston, MA
-
I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo. The maximum clique problem. In D.-Z. Du and P.M. Pardalos, editors, H and book of Combinatorial Optimization, volume 4, pages 1–74. Kluwer Academic Publishers, Boston, MA, 1999.
-
(1999)
H and Book of Combinatorial Optimization
, vol.4
, pp. 1-74
-
-
Bomze, I.M.1
Budinich, M.2
Pardalos, P.M.3
Pelillo, M.4
-
3
-
-
0026385082
-
Approximating clique is almost np-complete
-
U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy. Approximating clique is almost np-complete. In Proc. 32nd Ann. IEEE Symp. Found. Comput. Sci., pages 2–12, 1991.
-
(1991)
Proc. 32Nd Ann. IEEE Symp. Found. Comput. Sci
, pp. 2-12
-
-
Feige, U.1
Goldwasser, S.2
Lovasz, L.3
Safra, S.4
Szegedy, M.5
-
4
-
-
0030125301
-
Comparisons of energy-descent optimization algorithms for maximum clique
-
N. Funabiki and S. Nishikawa. Comparisons of energy-descent optimization algorithms for maximum clique. IEICE Trans. Fundamentals, E79-A(4):452–460, 1996.
-
(1996)
IEICE Trans. Fundamentals
, vol.E79-A
, Issue.4
, pp. 452-460
-
-
Funabiki, N.1
Nishikawa, S.2
-
6
-
-
0018321324
-
Clique detection for nondirected graphs: Two new algorithms
-
L. Gerhards and W. Lindenberg. Clique detection for nondirected graphs: two new algorithms. Computing, 21:295–322, 1979.
-
(1979)
Computing
, vol.21
, pp. 295-322
-
-
Gerhards, L.1
Lindenberg, W.2
-
7
-
-
0001217319
-
On the performance of polynomial-time clique approximation algorithms
-
D.S. Johnson and M. Trick, editors, American Mathematical Society
-
S. Homer and M. Peinado. On the performance of polynomial-time clique approximation algorithms. In D.S. Johnson and M. Trick, editors, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996.
-
(1996)
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science
-
-
Homer, S.1
Peinado, M.2
-
8
-
-
0021835689
-
Neural computation of decisions in optimization problems
-
J.J. Hopfield and D.W. Tank. Neural computation of decisions in optimization problems. Biological Cybernetics, 52:141–152, 1985.
-
(1985)
Biological Cybernetics
, vol.52
, pp. 141-152
-
-
Hopfield, J.J.1
Tank, D.W.2
-
10
-
-
0029304809
-
Approximating maximum clique with a Hopfieldnet work
-
A. Jagota. Approximating maximum clique with a Hopfieldnet work. IEEE Trans. Neural Networks, 6:724–735, 1995.
-
(1995)
IEEE Trans. Neural Networks
, vol.6
, pp. 724-735
-
-
Jagota, A.1
-
11
-
-
3142731265
-
Distance-basedclassification of structures within a connectionist framework
-
R. Klinkenberg et al., editor
-
B.J. Jain and F. Wysotzki. Distance-basedclassification of structures within a connectionist framework. In R. Klinkenberg et al., editor, Proceedings Fachgruppentreffen Maschinelles Lernen, 2001.
-
(2001)
Proceedings Fachgruppentreffen Maschinelles Lernen
-
-
Jain, B.J.1
Wysotzki, F.2
-
12
-
-
0024735683
-
Graph theoretic algorithms for the pla folding problem
-
J.E. Lecky, O.J. Murphy, and R.G. Absher. Graph theoretic algorithms for the pla folding problem. IEEE Transactions on Computer Aided Design, 8(9):1014–1021, 1989.
-
(1989)
IEEE Transactions on Computer Aided Design
, vol.8
, Issue.9
, pp. 1014-1021
-
-
Lecky, J.E.1
Murphy, O.J.2
Absher, R.G.3
-
13
-
-
0022523995
-
Labeledp oint pattern matching by delauney triangulation and maximal cliques
-
H. Ogawa. Labeledp oint pattern matching by delauney triangulation and maximal cliques. Pattern Recognition, 19(1):35–40, 1986.
-
(1986)
Pattern Recognition
, vol.19
, Issue.1
, pp. 35-40
-
-
Ogawa, H.1
-
14
-
-
0033220897
-
Matching hierarchical structures using association graphs
-
M. Pelillo, K. Siddiqi, and S.W. Zucker. Matching hierarchical structures using association graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(11):1105–1120, 1999.
-
(1999)
IEEE Transactions on Pattern Analysis and Machine Intelligence
, vol.21
, Issue.11
, pp. 1105-1120
-
-
Pelillo, M.1
Siddiqi, K.2
Zucker, S.W.3
-
15
-
-
23544480048
-
Application of a neural net in classification and knowledge discovery
-
M. Verleysen, editor, D-Facto, Brussels
-
K. Schädler and F. Wysotzki. Application of a neural net in classification and knowledge discovery. In M. Verleysen, editor, Proc. ESANN’98, pages 117–122. D-Facto, Brussels, 1998.
-
(1998)
Proc. ESANN’98
, pp. 117-122
-
-
Schädler, K.1
Wysotzki, F.2
-
16
-
-
0344240183
-
Comparing structures using a Hopfield-style neural network
-
K. Schädler and F. Wysotzki. Comparing structures using a Hopfield-style neural network. Applied Intelligence, 11:15–30, 1999.
-
(1999)
Applied Intelligence
, vol.11
, pp. 15-30
-
-
Schädler, K.1
Wysotzki, F.2
-
17
-
-
0002381070
-
Neural networks for combinatorial optimisation: A review of more than a decade of research
-
K.A. Smith. Neural networks for combinatorial optimisation: A review of more than a decade of research. INFORMS Journal on Computing, 11(1):15–34, 1999.
-
(1999)
INFORMS Journal on Computing
, vol.11
, Issue.1
, pp. 15-34
-
-
Smith, K.A.1
|