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.
- Improving an upper bound on the stability number of a graph (Q556012) (← links)
- Variable neighborhood search for the maximum clique (Q705505) (← links)
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures (Q794664) (← links)
- Ernst G. Straus (1922-1983) (Q800339) (← links)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- Extremal problems whose solutions are the blowups of the small Witt- designs (Q807640) (← links)
- Asymptotic solution for a new class of forbidden r-graphs (Q809090) (← links)
- Walks and the spectral radius of graphs (Q852649) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- A linear programming reformulation of the standard quadratic optimization problem (Q868634) (← links)
- A characterization of Delsarte's linear programming bound as a ratio bound (Q876308) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- Using Lagrangians of hypergraphs to find non-jumping numbers. II. (Q879390) (← 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)
- 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)
- 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)
- On copositive matrices with -1, 9, 1 entries (Q2264831) (← links)
- Turán-Ramsey theorems and simple asymptotically extremal structures (Q2367441) (← links)
- Numerical radius and zero pattern of matrices (Q2382745) (← links)
- A new trust region technique for the maximum weight clique problem (Q2433799) (← links)
- On a polynomial fractional formulation for independence number of a graph (Q2457911) (← links)
- A convergent decomposition algorithm for support vector machines (Q2475612) (← links)
- A hybrid heuristic for the maximum clique problem (Q2491328) (← links)
- A PTAS for the minimization of polynomials of fixed degree over the simplex (Q2503350) (← links)
- Two remarks on copositive matrices (Q2536109) (← links)
- A generalization of a theorem of Turán (Q2545883) (← links)
- Extremal problems for directed graphs (Q2557710) (← links)
- Quartic formulation of standard quadratic optimization problems (Q2576445) (← links)
- A hypergraph extension of Turán's theorem (Q2581504) (← links)
- D.C. versus copositive bounds for standard QP (Q2583183) (← links)
- Improved approximation of maximum vertex cover (Q2583713) (← links)
- Laplacian spectral bounds for clique and independence numbers of graphs (Q2642010) (← links)
- Cliques and the spectral radius (Q2642018) (← links)
- Image Segmentation by Dominant Sets (Q3438915) (← links)
- Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming (Q3439163) (← links)
- A spinorial formulation of the maximum clique problem of a graph (Q3441737) (← links)
- Algorithmic Solution of Extremal Digraph Problems (Q3745867) (← links)
- Inequalities in probability theory and turán-type problems for graphs with colored vertices (Q3970903) (← links)
- A global optimization approach for solving the maximum clique problem (Q4009762) (← links)