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):
Displaying 50 items.
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) (← links)
- Generating non-jumping numbers recursively (Q944738) (← links)
- A clique algorithm for standard quadratic programming (Q955308) (← links)
- A simpler characterization of a spectral lower bound on the clique number (Q966428) (← links)
- A trust branching path heuristic for zero-one programming (Q1014935) (← links)
- Complexity results for some global optimization problems (Q1024247) (← links)
- A generalization of the Motzkin-Straus theorem to hypergraphs (Q1024737) (← links)
- On extended connectivity indices (Q1037504) (← links)
- More spectral bounds on the clique and independence numbers (Q1044204) (← links)
- Spectral bounds for the clique and independence numbers of graphs (Q1079582) (← links)
- Optima of dual integer linear programs (Q1105488) (← links)
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs (Q1123216) (← links)
- Extremals of functions on graphs with applications to graphs and hypergraphs (Q1158166) (← links)
- Extremal graphs for weights (Q1301628) (← links)
- Turán's theorem and maximal degrees (Q1306430) (← links)
- Stable sets and polynomials (Q1313833) (← links)
- The maximum clique problem (Q1318271) (← links)
- On the jumping constant conjecture for multigraphs (Q1345881) (← links)
- A lower bound on the independence number of a graph (Q1584341) (← links)
- Annealed replication: A new heuristic for the maximum clique problem (Q1613385) (← links)
- Maximum cliques of hypergraphs and polynomial optimization (Q1617049) (← links)
- Computation of sparse and dense equilibrium strategies of evolutionary games (Q1630457) (← links)
- Degenerate Turán problems for hereditary properties (Q1630890) (← links)
- Convex envelopes of separable functions over regions defined by separable functions of the same type (Q1634777) (← links)
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions (Q1663794) (← links)
- Self-concordance is NP-hard (Q1675557) (← links)
- Lagrangians of hypergraphs: the Frankl-Füredi conjecture holds almost everywhere (Q1690055) (← links)
- Two extremal problems related to orders (Q1702839) (← links)
- Strong forms of stability from flag algebra calculations (Q1719577) (← links)
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 (Q1731962) (← links)
- Dense 3-uniform hypergraphs containing a large clique (Q1741994) (← links)
- Computing the \(p\)-spectral radii of uniform hypergraphs with applications (Q1747024) (← links)
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- A continuous characterization of the maximum vertex-weighted clique in hypergraphs (Q1752628) (← links)
- Dominant-set clustering: a review (Q1754006) (← links)
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)
- Separable standard quadratic optimization problems (Q1758025) (← links)
- Exact bounds on the order of the maximum clique of a graph. (Q1811073) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- On copositive matrices (Q1836720) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- Dense neighborhoods on affinity graph (Q1931579) (← links)
- Unconstrained formulation of standard quadratic optimization problems (Q1935878) (← links)
- NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
- Global optimization problems and domain reduction strategies (Q1960192) (← links)
- On the quality of first-order approximation of functions with Hölder continuous gradient (Q1985266) (← links)
- Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma (Q1987329) (← links)
- Some results on the bounds of signless Laplacian eigenvalues (Q2017701) (← links)
- Potential energy principles in networked systems and their connections to optimization problems on graphs (Q2018871) (← links)
- Eigenvalues and chromatic number of a signed graph (Q2020660) (← links)
