Extended dependency graphs and efficient distributed fixed-point computation
From MaRDI portal
Publication:1662534
Recommendations
- A distributed fixed-point algorithm for extended dependency graphs
- Distributed computation of fixed points on dependency graphs
- Distributed computation of large-scale graph problems
- Parallel dynamical systems over directed dependency graphs
- Distributed graph problems through an automata-theoretic lens
- Distributed graph problems through an automata-theoretic Lens
- Distributed core decomposition in probabilistic graphs
- scientific article; zbMATH DE number 1555967
- Optimizing declarative parallel distributed graph processing by using constraint solvers
- Distributed graph traversals by relabelling systems with applications
Cited in
(9)- Distributed computation of fixed points on dependency graphs
- On the Verification of Weighted Kripke Structures Under Uncertainty
- An assessment of assignment schemes for dependency graphs
- Model checking and synthesis for branching multi-weighted logics
- A distributed fixed-point algorithm for extended dependency graphs
- On-the-Fly Synthesis for Strictly Alternating Games
- Model verification through dependency graphs
- Abstract Dependency Graphs and Their Application to Model Checking
- Elimination of detached regions in dependency graph verification
This page was built for publication: Extended dependency graphs and efficient distributed fixed-point computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662534)