All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Extending a Genetic Algorithm for Good Spanners of Hypercubes

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10397576" target="_blank" >RIV/00216208:11320/19:10397576 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/CEC.2019.8790306" target="_blank" >https://doi.org/10.1109/CEC.2019.8790306</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/CEC.2019.8790306" target="_blank" >10.1109/CEC.2019.8790306</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Extending a Genetic Algorithm for Good Spanners of Hypercubes

  • Original language description

    The usage of hypercubes as network architectures motivates the task of finding sparse spanners of hypercubes with good properties. These include maintaining the distance between vertices or reducing the maximal degree of the spanner. Namely, a 3-spanner guarantees that neighbours in the original graph remain within distance 3 in the spanner. A genetic algorithm designed for finding a 3-spanner of minimal size is extended by adding two new mutations. Further, a fitness function that aims for reduction of the maximal degree in the spanner while keeping the 3-spanner property is proposed. This fitness function brings intriguing results that combine both the mentioned properties, improve currently known size of 3-spanner with the minimal maximal degree and give a promising perspective for further improvements.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA19-08554S" target="_blank" >GA19-08554S: Structures and algorithms in highly symmetric graphs</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2019

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    2019 IEEE Congress on Evolutionary Computation (CEC)

  • ISBN

    978-1-72812-153-6

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

    952-957

  • Publisher name

    IEEE

  • Place of publication

    345 E 47TH ST, NEW YORK, NY 10017 USA

  • Event location

    Wellington, Nový Zéland

  • Event date

    Jun 10, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000502087100126