Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: exhaustive search algorithm

Sortuj według:

Ogranicz wyniki do:

On the independence number of some strong products of cycle-powers

Jurkiewicz M., Kubale M., Ocetkiewicz K.

Foundations of Computing and Decision Sciences

2015

Vol. 40, No. 2

133--141

In the paper we give some theoretical and computational results on the third strong power of cycle-powers, for example, we have found the independence numbers α((C210)⊠3) = 30 and α((C414)⊠3) = 14. A number of optimizations have been introduced to improve the running time of our exhaustive algorithm used to establish the independence number of the third strong power of cycle-powers. Moreover, our results establish new exact values and/or lower bounds on the Shannon capacity of noisy channels.