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.
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- The \(k\)-regular induced subgraph problem (Q1786867) (← links)
- The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters (Q1791705) (← links)
- On the capacity of Boolean graph formulæ (Q1805371) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- The gap between monotone and non-monotone circuit complexity is exponential (Q1813126) (← links)
- Orthogonal representations and connectivity of graphs (Q1823259) (← links)
- Geometrical embeddings of graphs (Q1825202) (← links)
- Improved lower bound on the Shannon capacity of \(C_7\) (Q1847390) (← links)
- Bicliques and eigenvalues (Q1850533) (← links)
- The \(k\)-fractal of a simplicial complex (Q1877647) (← links)
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) (← links)
- On the ultimate independence ratio of a graph (Q1893949) (← links)
- The geometry of graphs and some of its algorithmic applications (Q1894703) (← links)
- Interlacing eigenvalues and graphs (Q1899437) (← links)
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)
- On the ultimate normalized chromatic difference sequence of a graph (Q1910556) (← links)
- On product of association schemes and Shannon capacity (Q1916139) (← links)
- An upper bound on the independence number of a graph computable in polynomial-time (Q1919180) (← links)
- Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840) (← links)
- On the bounds for the ultimate independence ratio of a graph (Q1923515) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- On the Shannon capacity of triangular graphs (Q1953512) (← links)
- Control and estimation under information constraints: toward a unified theory of control, computation and communications (Q1956912) (← links)
- Sandwich theorems and capacity bounds for non-commutative graphs (Q2005181) (← links)
- A completely positive formulation of the graph isomorphism problem and its positive semidefinite relaxation (Q2023115) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- Partitioning transitive tournaments into isomorphic digraphs (Q2035088) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- On the arithmetic mean of the size of cross-union families (Q2043692) (← links)
- Tensor theta norms and low rank recovery (Q2048814) (← links)
- A unified construction of semiring-homomorphic graph invariants (Q2052822) (← links)
- On the N-spectrum of oriented graphs (Q2053390) (← links)
- Generalized Greenberger-Horne-Zeilinger arguments from quantum logical analysis (Q2062524) (← links)
- Probabilistic refinement of the asymptotic spectrum of graphs (Q2064765) (← links)
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
- On zero-error codes produced by greedy algorithms (Q2084654) (← links)
- Lovász theta approach to eventown problem (Q2085430) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Dynamic node packing (Q2097666) (← links)
- Dual bounds for the positive definite functions approach to mutually unbiased bases (Q2098296) (← links)
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015) (← links)
- More tales of Hoffman: bounds for the vector chromatic number of a graph (Q2107750) (← links)
- On the Shannon capacity of sums and products of graphs (Q2111251) (← links)
- Spectrum of Johnson graphs (Q2111919) (← links)
- Complete positivity and distance-avoiding sets (Q2118086) (← links)
- Subgraph complementation and minimum rank (Q2121776) (← links)
- Algebras, graphs and thetas (Q2132354) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- On the subspace choosability in graphs (Q2138578) (← links)
