This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n14http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F01%3A00004836%21RIV%2F2002%2FGA0%2F143302%2FN/
dctermshttp://purl.org/dc/terms/
n12http://purl.org/net/nknouf/ns/bibtex#
n9http://localhost/temp/predkladatel/
n20http://linked.opendata.cz/resource/domain/vavai/projekt/
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n10http://linked.opendata.cz/ontology/domain/vavai/
n13http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F01%3A00004836%21RIV%2F2002%2FGA0%2F143302%2FN
rdf:type
n10:Vysledek skos:Concept
dcterms:description
A distributed algorithm for single source shortest path problem in an arbitrary directed graph which can contain negative length cycles is presented. The new algorithm is a label-correcting one and uses a novel way for detection of negative length cycles. It works on a network of processors with disjoint memory that communicate via message passing. Correctness of the algorithm is proved. The algorithm is work-efficient as its worst time complexity is O(n^3/p), where p is the number of processors. A distributed algorithm for single source shortest path problem in an arbitrary directed graph which can contain negative length cycles is presented. The new algorithm is a label-correcting one and uses a novel way for detection of negative length cycles. It works on a network of processors with disjoint memory that communicate via message passing. Correctness of the algorithm is proved. The algorithm is work-efficient as its worst time complexity is O(n^3/p), where p is the number of processors.
dcterms:title
Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths
skos:prefLabel
Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths
skos:notation
RIV/00216224:14330/01:00004836!RIV/2002/GA0/143302/N
n3:aktivita
n8:Z n8:P
n3:aktivity
P(GA201/00/1023), Z(MSM 143300001)
n3:dodaniDat
n5:2002
n3:domaciTvurceVysledku
n15:6500773 n15:4686128 n15:6986080 n15:2361132
n3:druhVysledku
n19:B
n3:duvernostUdaju
n11:S
n3:entitaPredkladatele
n14:predkladatel
n3:idSjednocenehoVysledku
677965
n3:idVysledku
RIV/00216224:14330/01:00004836
n3:jazykVysledku
n18:eng
n3:klicovaSlova
Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths
n3:klicoveSlovo
n17:Distributed%20Shortest%20Paths%20for%20Directed%20Graphs%20with%20Negative%20Edge%20Lengths
n3:kontrolniKodProRIV
[1969614A04C8]
n3:mistoVydani
Brno
n3:nazevEdiceCisloSvazku
Technical Reports, FIMU-RS-2001-01
n3:nazevZdroje
Distributed Shortest Paths for Directed Graphs with Negative Edge Lengths
n3:obor
n4:JC
n3:pocetDomacichTvurcuVysledku
4
n3:pocetStranKnihy
19
n3:pocetTvurcuVysledku
4
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n20:GA201%2F00%2F1023
n3:rokUplatneniVysledku
n5:2001
n3:tvurceVysledku
Černá, Ivana Brim, Luboš Pelánek, Radek Krčál, Pavel
n3:zamer
n13:MSM%20143300001
s:numberOfPages
19
n12:hasPublisher
Masarykova univerzita. Fakulta informatiky
n9:organizacniJednotka
14330