A continuous characterization of maximal cliques in k-uniform hypergraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5313 LNCS, Issue , 2008, Pages 220-233

  Bulò, Samuel Rota ^a   Pelillo, Marcello ^a  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CLIQUE NUMBERS; CONTINUOUS OPTIMIZATIONS; HYPER GRAPHS; LAGRANGIAN; MAXIMAL CLIQUES; MAXIMUM CLIQUE PROBLEMS;

DYNAMICAL SYSTEMS; OPTIMIZATION; SET THEORY;

GRAPH THEORY;

EID: 58349113185     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92695-5_17     Document Type: Conference Paper

References (30)

1. Baum, L.E., Eagon, J.A.: An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology. Bull. Amer. Math. Soc. 73, 360-363 (1967)
2. Baum, L.E., Petrie, T., Soutes, G., Weiss, N.: A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math. Statist. 41, 164-171 (1970)
3. Baum, L.E., G.R.: Sell Growth transformations for functions on manifolds. Pacific J. Math. 27, 211-227 (1968)
4. Berge, C.: Hypergraphs. Combinatorics of Finite Sets. Ed. North-Holland, Amsterdam (1989)
5. Blakley, G.R.: Homogeneous nonnegative symmetric quadratic transformations. Bull. Amer. Math. Soc. 70, 712-715 (1964)
6. Bomze, I.M., Pelillo, M., Giacomini, R.: Evolutionary approach to the maximum clique problem: empirical evidence on a larger scale. Developments in Global Optimization, 95-108 (1997)
7. Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Handbook of Combinatorial Optimization (Supplement Volume A), pp. 1-74 (1999)
8. Bomze, I.M., Budinich, M., Pelillo, M., Rossi, C.: Annealed replication: a new heuristic for the maximum clique problem. Discr. Appl. Math. 121(1-3), 27-49 (2002)
9. Budinich, M.: Exact bounds on the order of the maximum clique of a graph. Discr. Appl. Math. 127, 535-543 (2003)
10. Bunke, H., Dickinson, P.J., Kraetzl, M.: Theoretical and Algorithmic Framework for Hypergraph Matching. In: ICIAP, pp. 463-470 (2005)
11. Faugeras, O.D., Berthod, M.: Improving consistency and reducing ambiguity in stochastic labeling: an optimization approach. IEEE Trans. Pattern Anal. Machine Intell. 3, 412-424 (1981)
12. Frankl, P., Rödl, V.: Hypergraphs do not jump. J. Combinatorica 4, 149-159 (1984)
13. Gibbons, L.E., Hearn, D.W., Pardalos, P.M.: A continuous based heuristic for the maximum clique problem. In: Cliques, Coloring and Satisfiability: 2nd DIMACS Impl. Chall., vol. 26, pp. 103-124 (1996)
14. Gibbons, L.E., Hearn, D.W., Pardalos, P.M., Ramana, M.V.: Continuous characterizations of the maximum clique problem. Math. Oper. Res. 22, 754-768 (1997)
15. Khot, S.: Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: Proc. of 42nd Ann. IEEE Symp. on Found, of Comp. Sc., pp. 600-609 (2001)
16. Mohammed, J.L., Hummel, R.A., Zucker, S.W.: A gradient projection algorithm for relaxation labeling methods. IEEE Trans. Pattern Anal. Machine Intell. 5, 330-332 (1983)
17. Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Turán. Canad. J. Math. 17, 533-540 (1965)
18. Mubay, D.: A hypergraph extension of Turán's theorem. J. Combin. Theory B 96, 122-134 (2006)
19. Papa, D.A., Markov, I.: Hypergraph Partitioning and Clustering. In: Approximation Algorithms and Metaheuristics, pp. 61.1- 61.19 (2007)
20. Pardalos, P.M.: Continuous approaches to discrete optimization problems. In: Nonlinear Optimization and Applications, pp. 313-328 (1996)
21. Pardalos, P.M., Phillips, A.T.: A global optimization approach for solving the maximum clique problem. Int. J. Comput. Math. 33, 209-216 (1990)
22. Pavan, M., Pelillo, M.: Generalizing the Motzkin-Straus theorem to edge-weighted graphs, with applications to image segmentation. In: Rangarajan, A., Figueiredo, M.A.T., Zerubia, J. (eds.) EMMCVPR 2003. LNCS, vol. 2683, pp. 485-500. Springer, Heidelberg (2003)
23. Pelillo, M.: Relaxation labeling networks for the maximum clique problem. J. Artif. Neural Networks 2, 313-328 (1995)
24. Pelillo, M., Jagota, A.: Feasible and infeasible maxima in a quadratic program for maximum clique. J. Artif. Neural Networks 2, 411-420 (1995)
25. Rota Buló, S., Pelillo, M.: A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Tech. Report CS-2007-4, "Ca' Foscari" University of Venice (2007)
26. Sos, V.T., Straus, E.G.: Extremal of functions on graphs with applications to graphs and hypergraphs. J. Combin. Theory B 63, 189-207 (1982)
27. Turán, P.: On an extremal problem in graph theory (in Hungarian). Mat. ès Fiz. Lapok 48, 436-452 (1941)
28. Wilf, H.S.: The eigenvalues of a graph and its chromatic number. J. London Math. Soc. 42, 330-332 (1967)
29. Wilf, H.S.: Spectral bounds for the clique and independence numbers of graphs. J. Combin. Theory Ser. B 40, 113-117 (1986)
30. Zhou, D., Huang, J., Schölkopf, B.: Learning with hypergraphs: clustering, classification, embedding. Neural Inform. Proc. Systems 19 (2006)