Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: 10.1007/s10703-016-0246-7
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Universitätsbibliothek der RWTH Aachen
- (when)
-
2016
- Creator
- DOI
-
10.18154/RWTH-2016-09299
- URN
-
urn:nbn:de:101:1-2018062708172820629281
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:54 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Wijs, Anton
- Katoen, Joost-Pieter
- Bošnački, Dragan
- Universitätsbibliothek der RWTH Aachen
Time of origin
- 2016
Other Objects (12)
Concepts, algorithms, and tools for model checking
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration
Automatically Finding the Right Probabilities in Bayesian Networks
Sound Value Iteration
Fine-Tuning the Odds in Bayesian Networks
Formal methods for real time and probabilistic systems : proceedings
Multi-objective Optimization of Long-run Average and Total Rewards
Verification of pointer programs
Foundations of probabilistic programming
Under-Approximating Expected Total Rewards in POMDPs
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Dynamic fault trees: semantics, analysis and applications
Concepts, algorithms, and tools for model checking
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration
Automatically Finding the Right Probabilities in Bayesian Networks
Sound Value Iteration
Fine-Tuning the Odds in Bayesian Networks
Formal methods for real time and probabilistic systems : proceedings
Multi-objective Optimization of Long-run Average and Total Rewards
Verification of pointer programs
Foundations of probabilistic programming
Under-Approximating Expected Total Rewards in POMDPs
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Dynamic fault trees: semantics, analysis and applications
Concepts, algorithms, and tools for model checking
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration
Automatically Finding the Right Probabilities in Bayesian Networks
Sound Value Iteration
Fine-Tuning the Odds in Bayesian Networks
Formal methods for real time and probabilistic systems : proceedings
Multi-objective Optimization of Long-run Average and Total Rewards
Verification of pointer programs
Foundations of probabilistic programming
Under-Approximating Expected Total Rewards in POMDPs
Invariant-based strategy synthesis for nondeterministic probabilistic programs