Pages that link to "Item:Q5338788"
From MaRDI portal
The following pages link to Maxima for Graphs and a New Proof of a Theorem of Turán (Q5338788):
Displayed 50 items.
- Optimisation of quadratic forms associated with graphs (Q4124867) (← links)
- The inducibility of complete bipartite graphs (Q4309990) (← links)
- Neural networks for NP-complete problems (Q4377229) (← links)
- Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem (Q4571924) (← links)
- Nuclear norm of higher-order tensors (Q4605699) (← links)
- Solving Quadratic Programming by Cutting Planes (Q4634098) (← links)
- A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) (← links)
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (Q4687245) (← links)
- (Q4968665) (← links)
- Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization (Q4991677) (← links)
- Eigenvalues and triangles in graphs (Q4993261) (← links)
- Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems (Q5038440) (← links)
- A generalization of a Turán’s theorem about maximum clique on graphs (Q5054044) (← links)
- On the Aα-spectral radius of connected graphs (Q5056833) (← links)
- The number of $4$-cycles and the cyclomatic number of a finite simple graph (Q5060435) (← links)
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX (Q5060504) (← links)
- Fast Cluster Detection in Networks by First Order Optimization (Q5065475) (← links)
- An Irrational Lagrangian Density of a Single Hypergraph (Q5067428) (← links)
- Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph (Q5072588) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
- A General Regularized Continuous Formulation for the Maximum Clique Problem (Q5108235) (← links)
- Spectral norm of a symmetric tensor and its computation (Q5113665) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- The p-spectral radius of the Laplacian matrix (Q5155722) (← links)
- Best Nonnegative Rank-One Approximations of Tensors (Q5203971) (← links)
- A survey on graphs with convex quadratic stability number (Q5207733) (← links)
- Optimality conditions for linear copositive programming problems with isolated immobile indices (Q5207739) (← links)
- Certifying Polynomial Nonnegativity via Hyperbolic Optimization (Q5208888) (← links)
- Lyapunov Exponent of Rank-One Matrices: Ergodic Formula and Inapproximability of the Optimal Distribution (Q5217944) (← links)
- GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS (Q5242395) (← links)
- New analytical lower bounds on the clique number of a graph (Q5268926) (← links)
- Existence of Evolutionarily Stable Strategies Remains Hard to Decide for a Wide Range of Payoff Values (Q5283386) (← links)
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians (Q5366952) (← links)
- The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs (Q5366960) (← links)
- An Error Analysis for Polynomial Optimization over the Simplex Based on the Multivariate Hypergeometric Distribution (Q5502241) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)
- Approximating the existential theory of the reals (Q5918470) (← links)
- Strong Turán stability (Q5920701) (← links)
- Some Motzkin-Straus type results for non-uniform hypergraphs (Q5963619) (← links)
- A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs (Q5963623) (← links)
- Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs (Q5963658) (← links)
- A characterization of the weighted Lovász number based on convex quadratic programming (Q5963688) (← links)
- Hypergraph Turán densities can have arbitrarily large algebraic degree (Q6038595) (← links)
- Homogenization for polynomial optimization with unbounded sets (Q6044977) (← links)
- A tensor optimization algorithm for computing Lagrangians of hypergraphs (Q6051173) (← links)
- (Q6054916) (← links)
- Discrimination between Gaussian process models: active learning and static constructions (Q6080702) (← links)
- Refinement on Spectral Turán’s Theorem (Q6081801) (← links)
- Lagrangian-perfect hypergraphs (Q6084663) (← links)