Improved lower bound on the Shannon capacity of \(C_7\)

DOI10.1016/S0020-0190(01)00229-0zbMath1048.94502OpenAlexW2043256046MaRDI QIDQ1847390

Aleksander Vesel, Janez Žerovnik

Publication date: 24 June 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00229-0

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Related Items (9)

On the independence number of some strong products of cycle-powers ⋮ New lower bounds for the Shannon capacity of odd cycles ⋮ Semidefinite programming relaxations for graph coloring and maximal clique problems ⋮ The zero-error capacity of binary channels with 2-memories ⋮ Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers ⋮ On the Shannon capacity of triangular graphs ⋮ New lower bound on the Shannon capacity of \(C_7\) from circular graphs ⋮ Connectivity of strong products of graphs ⋮ \(L(2,1)\)-labeling of direct product of paths and cycles

Uses Software

• NISPOC

Cites Work

• Unnamed Item
• Unnamed Item
• A randomised 3-colouring algorithm
• The independence number of the strong product of cycles
• Simulated annealing - to cool or not
• Bounding the probability of success of stochastic methods for global optimization
• Algebraic matching theory
• Numerical invariants and the strong product of graphs
• Convergence and finite-time behavior of simulated annealing
• On the Shannon capacity of a graph
• Simulated Annealing: Searching for an Optimal Temperature Schedule
• Independence numbers of product graphs

This page was built for publication: Improved lower bound on the Shannon capacity of \(C_7\)