Zpět na vyhledávání

RNDr. Ondrej Moriš

Bachelor's thesis

Rychlé hledání cesty v obřích grafech

Route-planning in huge graphs
Abstract:
In this thesis we are concerned with route-planning in huge graphs representing real-world road maps: for a given pair of vertices of a road map we want to very effectively find optimal path between them. The application area of this are car GPS navigation systems. Our work introduces a completely new promising approach based on a branch-decomposition and bidirectional search. The main focus of our …more
 

Keywords

bidirectional search branch-decomposition Dijkstra's algorithm GPS navigation systems graph theory reach route-planning scope
 
Language used: English
Date on which the thesis was submitted / produced: 19. 5. 2008
Identifier: https://is.muni.cz/th/ha3il/

Thesis defence

  • Date of defence: 23. 6. 2008
  • Supervisor: prof. RNDr. Petr Hliněný, Ph.D.
  • Reader: doc. Mgr. Jan Obdržálek, PhD.

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