On The Independence Number Of Some Strong Products Of Cycle-Powers
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 α((C102)√3) = 30 and α((C144)√3) = 14. A number of optimizations have been introduced to improve the running time of our exhaustive algorithm...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2015-06-01
|
Series: | Foundations of Computing and Decision Sciences |
Subjects: | |
Online Access: | https://doi.org/10.1515/fcds-2015-0009 |
id |
doaj-f381b1bfddd548ec804b3873a50042e8 |
---|---|
record_format |
Article |
spelling |
doaj-f381b1bfddd548ec804b3873a50042e82021-09-05T20:44:57ZengSciendoFoundations of Computing and Decision Sciences2300-34052015-06-0140213314110.1515/fcds-2015-0009On The Independence Number Of Some Strong Products Of Cycle-PowersJurkiewicz Marcin0Kubale Marek1Ocetkiewicz Krzysztof2Gdansk University of Technology, Faculty of Electronics, Telecommunications and Informatics, Department of Algorithms and System Modelling, Gabriela Narutowicza 11/12, 80-233 Gdansk, PolandGdansk University of Technology, Faculty of Electronics, Telecommunications and Informatics, Department of Algorithms and System Modelling, Gabriela Narutowicza 11/12, 80-233 Gdansk, PolandGdansk University of Technology, Faculty of Electronics, Telecommunications and Informatics, Department of Algorithms and System Modelling, Gabriela Narutowicza 11/12, 80-233 Gdansk, PolandIn 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 α((C102)√3) = 30 and α((C144)√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.https://doi.org/10.1515/fcds-2015-0009strong productexhaustive search algorithmindependence numbershannon capacity |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Jurkiewicz Marcin Kubale Marek Ocetkiewicz Krzysztof |
spellingShingle |
Jurkiewicz Marcin Kubale Marek Ocetkiewicz Krzysztof On The Independence Number Of Some Strong Products Of Cycle-Powers Foundations of Computing and Decision Sciences strong product exhaustive search algorithm independence number shannon capacity |
author_facet |
Jurkiewicz Marcin Kubale Marek Ocetkiewicz Krzysztof |
author_sort |
Jurkiewicz Marcin |
title |
On The Independence Number Of Some Strong Products Of Cycle-Powers |
title_short |
On The Independence Number Of Some Strong Products Of Cycle-Powers |
title_full |
On The Independence Number Of Some Strong Products Of Cycle-Powers |
title_fullStr |
On The Independence Number Of Some Strong Products Of Cycle-Powers |
title_full_unstemmed |
On The Independence Number Of Some Strong Products Of Cycle-Powers |
title_sort |
on the independence number of some strong products of cycle-powers |
publisher |
Sciendo |
series |
Foundations of Computing and Decision Sciences |
issn |
2300-3405 |
publishDate |
2015-06-01 |
description |
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 α((C102)√3) = 30 and α((C144)√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. |
topic |
strong product exhaustive search algorithm independence number shannon capacity |
url |
https://doi.org/10.1515/fcds-2015-0009 |
work_keys_str_mv |
AT jurkiewiczmarcin ontheindependencenumberofsomestrongproductsofcyclepowers AT kubalemarek ontheindependencenumberofsomestrongproductsofcyclepowers AT ocetkiewiczkrzysztof ontheindependencenumberofsomestrongproductsofcyclepowers |
_version_ |
1717784809260974080 |