An analogue of the shannon capacity of a graph
SIAM Journal on Algebraic and Discrete Methods
A note on the Shannon capacity of run-length-limited codes
IEEE Transactions on Information Theory
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Optimal Distance Networks of Low Degree for Parallel Computers
IEEE Transactions on Computers
Distributed loop computer networks: a survey
Journal of Parallel and Distributed Computing
Randomized graph products, chromatic numbers, and Lovasz j-function
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Optimal distributed algorithms in unlabeled tori and chordal rings
Journal of Parallel and Distributed Computing
European Journal of Combinatorics
A Combinatorial Problem Related to Multimodule Memory Organizations
Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
Recursive Diagonal Torus: An Interconnection Network for Massively Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
On the Lovász Number of Certain Circulant Graphs
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Spirograph Theory: A Framework for Calculations on Digitized Straight Lines
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Information Theory
Repeated communication and Ramsey graphs
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We consider the problem of estimating the Shannon capacity of a circulant graph Cn,J of degree four with n vertices and chord length J, 2 ≤ J ≤ n, by computing its Lovász theta function θ(Cn,J). We present an algorithm that takes O(J) operations if J is an odd number, and O(n/J) operations if J is even. On the considered class of graphs our algorithm strongly outperforms the known algorithms for theta function computation.