About: Speeding up shortest path search in public transport networks

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Speeding up shortest path search in public transport networks Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	The searching for the shortest path in public transport networks can take more time than is acceptable for given situation. We have therefore searched for methods that speed up the given calculation. The approach, when the calculation is not performed on the original network but on the simplified one, seems to be very promising. The path found in the simplified network can be easily mapped to a corresponding path in the original network. In the case of the Prague public transport the simplified network has several times less nodes and the computation is speeded up correspondingly. The searching for the shortest path in public transport networks can take more time than is acceptable for given situation. We have therefore searched for methods that speed up the given calculation. The approach, when the calculation is not performed on the original network but on the simplified one, seems to be very promising. The path found in the simplified network can be easily mapped to a corresponding path in the original network. In the case of the Prague public transport the simplified network has several times less nodes and the computation is speeded up correspondingly. (en)
Title	Speeding up shortest path search in public transport networks Speeding up shortest path search in public transport networks (en)
skos:prefLabel	Speeding up shortest path search in public transport networks Speeding up shortest path search in public transport networks (en)
skos:notation	RIV/00216208:11320/09:00207439!RIV10-GA0-11320___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1ET100300517), P(GA201/09/0983), Z(MSM0021620838)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Žemlička, Michal
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	342927
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/09:00207439
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Speeding; shortest; search; public; transport; networks (en)
http://linked.open.../riv/klicoveSlovo	Speeding shortest networks search transport public
http://linked.open...ontrolniKodProRIV	[D5946BEFE2FB]
http://linked.open...v/mistoKonaniAkce	Neuveden
http://linked.open...i/riv/nazevZdroje	DATESO 2009
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Methods for Intelligent Systems and Their Applications in Datamining and Natural Language Processing Agile systems and service-oriented software
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Žemlička, Michal Martínek, Vladislav
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open...ain/vavai/riv/wos	000272412300001
http://linked.open.../riv/zahajeniAkce	2009-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Moderní metody, struktury a systémy informatiky
number of pages	12 (xsd:int)
http://purl.org/ne...btex#hasPublisher	České vysoké učení technické v Praze
https://schema.org/isbn	978-80-01-04323-3
http://localhost/t...ganizacniJednotka	11320
is http://linked.open...avai/riv/vysledek of	Speeding up shortest path search in public transport networks Speeding up shortest path search in public transport networks Speeding up shortest path search in public transport networks Speeding up shortest path search in public transport networks

Faceted Search & Find service v1.16.116 as of Feb 22 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3239 as of Feb 22 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software