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

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

Namespace Prefixes

PrefixIRI
n10http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n15http://localhost/temp/predkladatel/
n14http://purl.org/net/nknouf/ns/bibtex#
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n21http://linked.opendata.cz/ontology/domain/vavai/
n16https://schema.org/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://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#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216224%3A14330%2F07%3A00019374%21RIV10-GA0-14330___/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216224%3A14330%2F07%3A00019374%21RIV10-GA0-14330___
rdf:type
n21:Vysledek skos:Concept
dcterms:description
We examine existing parallel algorithms for detection of strongly connected components and discuss their applicability to the case when the graph to be decomposed is given implicitly. In particular, we list individual techniques that parallel algorithms for SCC detection are assembled from and show how to assemble a new more efficient algorithm for solving the problem. In the paper we also report on a preliminary experimental study we did to evaluate the new algorithm. We examine existing parallel algorithms for detection of strongly connected components and discuss their applicability to the case when the graph to be decomposed is given implicitly. In particular, we list individual techniques that parallel algorithms for SCC detection are assembled from and show how to assemble a new more efficient algorithm for solving the problem. In the paper we also report on a preliminary experimental study we did to evaluate the new algorithm.
dcterms:title
Parallel Algorithms for Finding SCCs in Implicitly Given Graphs Parallel Algorithms for Finding SCCs in Implicitly Given Graphs
skos:prefLabel
Parallel Algorithms for Finding SCCs in Implicitly Given Graphs Parallel Algorithms for Finding SCCs in Implicitly Given Graphs
skos:notation
RIV/00216224:14330/07:00019374!RIV10-GA0-14330___
n4:aktivita
n6:P n6:Z
n4:aktivity
P(1ET408050503), P(1M0545), P(GA201/06/1338), P(GD102/05/H050), Z(MSM0021622419)
n4:dodaniDat
n8:2010
n4:domaciTvurceVysledku
n9:5692792 n9:6656536
n4:druhVysledku
n22:D
n4:duvernostUdaju
n13:S
n4:entitaPredkladatele
n11:predkladatel
n4:idSjednocenehoVysledku
440573
n4:idVysledku
RIV/00216224:14330/07:00019374
n4:jazykVysledku
n20:eng
n4:klicovaSlova
distributed verification; SCCs
n4:klicoveSlovo
n5:distributed%20verification n5:SCCs
n4:kontrolniKodProRIV
[FC2A4E06F5EC]
n4:mistoKonaniAkce
Bonn, Germany
n4:mistoVydani
Berlin, Heidelberg
n4:nazevZdroje
Formal Methods: Applications and Technology
n4:obor
n18:IN
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
2
n4:projekt
n7:GA201%2F06%2F1338 n7:1M0545 n7:GD102%2F05%2FH050 n7:1ET408050503
n4:rokUplatneniVysledku
n8:2007
n4:tvurceVysledku
Barnat, Jiří Moravec, Pavel
n4:typAkce
n10:WRD
n4:wos
000245773800022
n4:zahajeniAkce
2006-01-01+01:00
n4:zamer
n12:MSM0021622419
s:numberOfPages
15
n14:hasPublisher
Springer-Verlag
n16:isbn
978-3-540-70951-0
n15:organizacniJednotka
14330