Novel Effective Algorithm for Synchronization Problem in Directed Graph

Kód výsledku v 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>

Nalezeny alternativní kódy

RIV/62690094:18470/17:50013401

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Novel Effective Algorithm for Synchronization Problem in Directed Graph

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Novel Effective Algorithm for Synchronization Problem in Directed Graph

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

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

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2017

Kód důvěrnosti údajů

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

Název statě ve sborníku

Lecture Notes in Computer Science

ISBN

978-3-319-67073-7

ISSN

0302-9743

e-ISSN

neuvedeno

Počet stran výsledku

10

Strana od-do

528-537

Název nakladatele

Springer Verlag

Místo vydání

Berlín

Místo konání akce

Nikósie

Datum konání akce

27. 9. 2017

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—