A global optimization approach for solving the maximum clique problem

DOI10.1080/00207169008803851MaRDI QIDQ4009762zbMATH OpenOpenAlexFDO

Authors A. T. Phillips, Panos M. Pardalos

Publication date 27 September 1992

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169008803851

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Cites work

• Algorithm 457: finding all cliques of an undirected graph
• Clique detection for nondirected graphs: Two new algorithms
• Constrained global optimization: algorithms and applications
• Determining the number of internal stability of a graph
• Finding a Maximum Clique in an Arbitrary Graph
• Finding a Maximum Independent Set
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Upper Bounds on the Order of a Clique of a Graph

Cited in

(34)

• A generalization of the Motzkin-Straus theorem to hypergraphs
• The maximum clique problem
• Annealed replication: A new heuristic for the maximum clique problem
• Maximum cliques of hypergraphs and polynomial optimization
• A continuous characterization of the maximum vertex-weighted clique in hypergraphs
• Dominant-set clustering: a review
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem
• Exact bounds on the order of the maximum clique of a graph.
• Modelling competitive Hopfield networks for the maximum clique problem
• A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
• A sublevel moment-SOS hierarchy for polynomial optimization
• On the maxima of Motzkin-Straus programs and cliques of graphs
• Continuous cubic formulations for cluster detection problems in networks
• An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
• Solving the maximum clique problem using a tabu search approach
• A Motzkin-Straus type result for 3-uniform hypergraphs
• Solving the maximum clique problem with symmetric rank-one non-negative matrix approximation
• On Motzkin-Straus type results for non-uniform hypergraphs
• Genetic algorithmic approach to find the maximum weight independent set of a graph
• Lagrangean decompositions for the unconstrained binary quadratic programming problem
• An algorithm for finding a maximum weighted independent set in an arbitrary graph
• A spinorial formulation of the maximum clique problem of a graph
• 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
• On graph-Lagrangians of hypergraphs containing dense subgraphs
• An Efficient Approximation Algorithm for Finding a Maximum Clique Using Hopfield Network Learning
• A tutorial on branch and cut algorithms for the maximum stable set problem
• On cliques and Lagrangians of hypergraphs
• On Lagrangians of \(r\)-uniform hypergraphs
• A general regularized continuous formulation for the maximum clique problem
• A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
• Some Motzkin-Straus type results for non-uniform hypergraphs
• Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
• Regularized standard polynomial programming formulations for the maximum clique problem
• On generalized KKT points for the Motzkin-Straus program

This page was built for publication: A global optimization approach for solving the maximum clique problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009762)