Pages that link to "Item:Q4178914"
From MaRDI portal
The following pages link to On the Shannon capacity of a graph (Q4178914):
Displaying 50 items.
- New lower bounds for the Shannon capacity of odd cycles (Q2364621) (← links)
- Sperner capacities (Q2366215) (← links)
- On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935) (← links)
- Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121) (← links)
- Algorithmic and explicit determination of the Lovász number for certain circulant graphs (Q2383537) (← links)
- Reductions between disjoint NP-pairs (Q2387199) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- On the copositive representation of binary and continuous nonconvex quadratic programs (Q2391001) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- Orthogonal representations of Steiner triple system incidence graphs (Q2404398) (← links)
- Spectral operators of matrices (Q2413097) (← links)
- A comparison of integer programming models for the partial directed weighted improper coloring problem (Q2414468) (← links)
- A survey on the missing Moore graph (Q2418974) (← links)
- Structure and supersaturation for intersecting families (Q2420562) (← links)
- Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming (Q2423782) (← links)
- Maximum \(k\)-regular induced subgraphs (Q2426653) (← links)
- Asymptotic values of the Hall-ratio for graph powers (Q2433717) (← links)
- An efficiently computable subgraph pattern support measure: counting independent observations (Q2435700) (← links)
- On the theta number of powers of cycle graphs (Q2439827) (← links)
- Book drawings of complete bipartite graphs (Q2440102) (← links)
- Large regular bipartite graphs with median eigenvalue 1 (Q2447959) (← links)
- Some advances on Lovász-Schrijver semidefinite programming relaxations of the fractional stable set polytope (Q2448881) (← links)
- Chromatic Gallai identities operating on Lovász number (Q2452384) (← links)
- Forbidding just one intersection, for permutations (Q2452427) (← links)
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← links)
- On the variance of Shannon products of graphs (Q2462357) (← links)
- A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- Sylow subgraphs in self-complementary vertex transitive graphs (Q2493840) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- Orthogonal representations over finite fields and the chromatic number of graphs (Q2563517) (← links)
- Local chromatic number and Sperner capacity (Q2565689) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- An orthogonal basis for functions over a slice of the Boolean hypercube (Q2635087) (← links)
- Effective storage capacity of labeled graphs (Q2637317) (← links)
- Copositivity cuts for improving SDP bounds on the clique number (Q2638373) (← links)
- Hoffman's ratio bound (Q2656649) (← links)
- Shannon capacity and the categorical product (Q2656906) (← links)
- On colorful edge triples in edge-colored complete graphs (Q2657036) (← links)
- Generating irreducible copositive matrices using the stable set problem (Q2664002) (← links)
- Varieties of contextuality based on probability and structural nonembeddability (Q2672646) (← links)
- Symmetric Shannon capacity is the independence number minus 1 (Q2678437) (← links)
- Approximating projections by quantum operations (Q2685389) (← links)
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
- Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes (Q2696926) (← links)
- High dimensional Hoffman bound and applications in extremal combinatorics (Q2700317) (← links)
- On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship (Q2700618) (← links)
- Origins and genesis (Q2758330) (← links)
