A continuous characterization of the maximum vertex-weighted clique in hypergraphs
From MaRDI portal
(Redirected from Publication:1752628)
Recommendations
- Continuous Characterizations of the Maximum Clique Problem
- A generalization of the Motzkin-Straus theorem to hypergraphs
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem
- Homogeneous multilinear functions on hypergraph cliques
- On cliques and Lagrangians of hypergraphs
Cites work
- A Continuous-Based Approach for Partial Clique Enumeration
- A generalization of the Motzkin-Straus theorem to hypergraphs
- A global optimization approach for solving the maximum clique problem
- A new trust region technique for the maximum weight clique problem
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- Continuous Characterizations of the Maximum Clique Problem
- Evolution towards the maximum clique
- Exact bounds on the order of the maximum clique of a graph.
- Global optimization with polynomials and the problem of moments
- Linear and nonlinear programming.
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Stable sets and polynomials
Cited in
(3)
This page was built for publication: A continuous characterization of the maximum vertex-weighted clique in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752628)