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”

Novel Effective Algorithm for Synchronization Problem in Directed Graph

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F17%3A50013401" target="_blank" >RIV/62690094:18450/17:50013401 - isvavai.cz</a>

  • Alternative codes found

    RIV/62690094:18470/17:50013401

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-67074-4_51" target="_blank" >http://dx.doi.org/10.1007/978-3-319-67074-4_51</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-67074-4_51" target="_blank" >10.1007/978-3-319-67074-4_51</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Novel Effective Algorithm for Synchronization Problem in Directed Graph

  • Original language description

    An effective algorithm for solving synchronization problem in directed graph is presented. The system is composed of vertices and edges. Entities are going through the system by given paths and can leave the vertex if all other entities which are going through this vertex have already arrived. The aim of this research is to create an algorithm for finding an optimal input vector of starting times of entities which gives minimal waiting time of entities in vertices and thus in a whole system. Asymptotic complexity of a given solution and using of brute-force method is discussed and compared. This algorithm is shown on an example from a field of train timetable problem.

  • 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

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2017

  • 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

    Lecture Notes in Computer Science

  • ISBN

    978-3-319-67073-7

  • ISSN

    0302-9743

  • e-ISSN

    neuvedeno

  • Number of pages

    10

  • Pages from-to

    528-537

  • Publisher name

    Springer Verlag

  • Place of publication

    Berlín

  • Event location

    Nikósie

  • Event date

    Sep 27, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article