Back to search

Bc. Martin Mucha

Master's thesis

Adaptivní algoritmy pro hledání nejkratších cest

On Dynamic Shortes Path Problems
Abstract:
Práce popisuje několik algoritmů pro hledání nejkratší cesty v dynamických grafech, pojednává o jejich implementaci, a poskytuje srovnání výkonnosti těchto algoritmů se statickým řešením tohoto problému.
Abstract:
This thesis describes a few algorithms for all pairs shortest paths problem in dynamic graphs. It contains information about how was each algorithm implemented and offers performance comparison of these algorithms between themselves and between themselves and Floyd-Warshall algorithm.
 

Keywords

all pairs shortest paths single source shortest paths dynamic algorithms
 
Language used: Czech
Date on which the thesis was submitted / produced: 18. 5. 2007
Identifier: https://is.muni.cz/th/uhnwc/

Thesis defence

  • Date of defence: 25. 6. 2007
  • Supervisor: prof. RNDr. Ivana Černá, CSc.

Citation record

Cite this text

Full text of thesis

Contents of on-line thesis archive
Published in Theses:
  • světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatiky
Složka Reference to the local database directory of the institution

Masaryk University

Faculty of Informatics

Master programme / field:
Applied Informatics / Applied Informatics

Theses on a related topic

List of theses with an identical keyword.