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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F03%3A00008594%21RIV08-MSM-14330___
rdf:type
n3:Vysledek skos:Concept
dcterms:description
Several new parallel algorithms for the single source shortest paths and for the negative cycle detection problems on directed graphs with real edge weights and given by adjacency list are developed, analysed, and experimentally compared. The algorithms are to be performed on clusters of workstations that communicate via a message passing mechanism. Several new parallel algorithms for the single source shortest paths and for the negative cycle detection problems on directed graphs with real edge weights and given by adjacency list are developed, analysed, and experimentally compared. The algorithms are to be performed on clusters of workstations that communicate via a message passing mechanism. Several new parallel algorithms for the single source shortest paths and for the negative cycle detection problems on directed graphs with real edge weights and given by adjacency list are developed, analysed, and experimentally compared. The algorithms are to be performed on clusters of workstations that communicate via a message passing mechanism.
dcterms:title
Parallel Algorithms for Detection of Negative Cycles Parallel Algorithms for Detection of Negative Cycles Parallel Algorithms for Detection of Negative Cycles
skos:prefLabel
Parallel Algorithms for Detection of Negative Cycles Parallel Algorithms for Detection of Negative Cycles Parallel Algorithms for Detection of Negative Cycles
skos:notation
RIV/00216224:14330/03:00008594!RIV08-MSM-14330___
n5:strany
98
n5:aktivita
n6:P n6:Z
n5:aktivity
P(GA201/03/0509), Z(MSM 143300001)
n5:dodaniDat
n19:2008
n5:domaciTvurceVysledku
n16:6500773 n16:3998193 n16:2361132
n5:druhVysledku
n13:D
n5:duvernostUdaju
n20:S
n5:entitaPredkladatele
n12:predkladatel
n5:idSjednocenehoVysledku
620317
n5:idVysledku
RIV/00216224:14330/03:00008594
n5:jazykVysledku
n14:eng
n5:klicovaSlova
model-checking; parallel computing
n5:klicoveSlovo
n7:parallel%20computing n7:model-checking
n5:kontrolniKodProRIV
[88FD8A03C25F]
n5:mistoKonaniAkce
Dresden, Germany
n5:mistoVydani
Holandsko
n5:nazevZdroje
Proceedings of the 10th ParCo Conference
n5:obor
n18:IN
n5:pocetDomacichTvurcuVysledku
3
n5:pocetTvurcuVysledku
3
n5:projekt
n17:GA201%2F03%2F0509
n5:rokUplatneniVysledku
n19:2003
n5:tvurceVysledku
Černá, Ivana Brim, Luboš Hejtmánek, Lukáš
n5:typAkce
n21:WRD
n5:zahajeniAkce
2003-01-01+01:00
n5:zamer
n8:MSM%20143300001
s:numberOfPages
14
n15:hasPublisher
Elsevier
n11:organizacniJednotka
14330