About: Parallel Algorithms for Finding SCCs in Implicitly Given Graphs

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

About: Parallel Algorithms for Finding SCCs in Implicitly Given Graphs 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	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. (en)
Title	Parallel Algorithms for Finding SCCs in Implicitly Given Graphs Parallel Algorithms for Finding SCCs in Implicitly Given Graphs (en)
skos:prefLabel	Parallel Algorithms for Finding SCCs in Implicitly Given Graphs Parallel Algorithms for Finding SCCs in Implicitly Given Graphs (en)
skos:notation	RIV/00216224:14330/07:00019374!RIV10-GA0-14330___
http://linked.open...avai/riv/aktivita	P Z
http://linked.open...avai/riv/aktivity	P(1ET408050503), P(1M0545), P(GA201/06/1338), P(GD102/05/H050), Z(MSM0021622419)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Moravec, Pavel Barnat, Jiří
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	Masarykova univerzita / Fakulta informatiky
http://linked.open...dnocenehoVysledku	440573
http://linked.open...ai/riv/idVysledku	RIV/00216224:14330/07:00019374
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	distributed verification; SCCs (en)
http://linked.open.../riv/klicoveSlovo	SCCs distributed verification
http://linked.open...ontrolniKodProRIV	[FC2A4E06F5EC]
http://linked.open...v/mistoKonaniAkce	Bonn, Germany
http://linked.open...i/riv/mistoVydani	Berlin, Heidelberg
http://linked.open...i/riv/nazevZdroje	Formal Methods: Applications and Technology
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Automated software verification Institute for Theoretical Computer Science Integrated Approach to Education of PhD Students in the Area of Parallel and Distributed Systems Techniques for automatic verification and validation of software and hardware systems
http://linked.open...UplatneniVysledku	2007
http://linked.open...iv/tvurceVysledku	Barnat, Jiří Moravec, Pavel
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000245773800022
http://linked.open.../riv/zahajeniAkce	2006-01-01 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Highly Parallel and Distributed Computing Systems
number of pages	15 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-540-70951-0
http://localhost/t...ganizacniJednotka	14330
is http://linked.open...avai/riv/vysledek of	Parallel Algorithms for Finding SCCs in Implicitly Given Graphs Parallel Algorithms for Finding SCCs in Implicitly Given Graphs Parallel Algorithms for Finding SCCs in Implicitly Given Graphs

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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