Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
From MaRDI portal
Publication:5963658
DOI10.1007/S10878-014-9798-XzbMATH Open1360.90256OpenAlexW2083611171MaRDI QIDQ5963658FDOQ5963658
Yuejian Peng, Yan-Ming Chang, Yuping Yao
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9798-x
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hypergraphs do not jump
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- A generalization of the Motzkin-Straus theorem to hypergraphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Extremal problems whose solutions are the blowups of the small Witt- designs
- Evolution towards the maximum clique
- Continuous Characterizations of the Maximum Clique Problem
- A new trust region technique for the maximum weight clique problem
- Exact bounds on the order of the maximum clique of a graph.
- A global optimization approach for solving the maximum clique problem
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications
Cited In (5)
- The connection between polynomial optimization, maximum cliques and Turán densities
- Maximum cliques of hypergraphs and polynomial optimization
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
- Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
- Connection between continuous optimization and Turán densities of non-uniform hypergraphs
Uses Software
This page was built for publication: Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963658)
