Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components (Q518409)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6697750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components |
scientific article; zbMATH DE number 6697750 |
Statements
Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components (English)
0 references
28 March 2017
0 references
parallel graph algorithms
0 references
strongly connected components
0 references
maximal end components
0 references
probabilistic model checking
0 references
Markov decision processes
0 references
GPU
0 references
0 references
0 references
0.7790860533714294
0 references
0.7564782500267029
0 references
0.7553234696388245
0 references
0.731907844543457
0 references
