On the Shannon capacity of triangular graphs

zbMath1267.05206MaRDI QIDQ1953512

Ashik Mathew Kizhakkepallathu, Alexandru Popa, Patric Rj Östergård

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p27

zbMATH Keywords

tabu searchShannon capacitycube packingzero-error capacity

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24)

Related Items (2)

New lower bounds for the Shannon capacity of odd cycles ⋮ Shannon capacity and the categorical product

Uses Software

• nauty
• TABARIS
• NISPOC
• Cliquer
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the independence numbers of the cubes of odd cycles
• TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
• Tabu search for large scale timetabling problems
• The independence number of the strong product of cycles
• A covering problem for tori
• Improved lower bound on the Shannon capacity of \(C_7\)
• A user's guide to tabu search
• On the Shannon capacity of a graph
• A limit theorem for the Shannon capacities of odd cycles I
• Zero-error information theory
• Independence numbers of product graphs

This page was built for publication: On the Shannon capacity of triangular graphs