Pregel
From MaRDI portal
Software:25330
No author found.
Related Items (38)
An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC ⋮ The evolving network model with community size and distance preferences ⋮ Unnamed Item ⋮ A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph ⋮ Fregel: a functional domain-specific language for vertex-centric large-scale graph processing ⋮ GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU ⋮ A Linear Logic Programming Language for Concurrent Programming over Graph Structures ⋮ Computing source-to-target shortest paths for complex networks in RDBMS ⋮ Personalized PageRank clustering: a graph clustering algorithm based on random walks ⋮ An algebra for distributed Big Data analytics ⋮ A survey on the distributed computing stack ⋮ Strong simulation ⋮ AutoDiagn: An Automated Real-Time Diagnosis Framework for Big Data Systems ⋮ Find Your Place: Simple Distributed Algorithms for Community Detection ⋮ Graph reconstruction in the congested clique ⋮ Modern Datalog Engines ⋮ A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation ⋮ Parallel algorithms for flexible pattern matching on big graphs ⋮ A Distributed Multilevel Force-Directed Algorithm ⋮ Using compressed suffix-arrays for a compact representation of temporal-graphs ⋮ Eigenvector Computation and Community Detection in Asynchronous Gossip Models ⋮ Fast Construction of Compressed Web Graphs ⋮ Unnamed Item ⋮ Distributed balanced partitioning via linear embedding ⋮ Axiomatization and characterization of BSP algorithms ⋮ Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers ⋮ Disk-based shortest path discovery using distance index over large dynamic graphs ⋮ The role of randomness in the broadcast congested clique model ⋮ Approximating small balanced vertex separators in almost linear time ⋮ An exact combinatorial algorithm for minimum graph bisection ⋮ A bounded-error quantum polynomial-time algorithm for two graph bisection problems ⋮ Sub-logarithmic distributed algorithms for metric facility location ⋮ Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts ⋮ A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions ⋮ Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy ⋮ Parallelizing Sequential Graph Computations ⋮ Linear-time parameterized algorithms with limited local resources ⋮ Distributed Core Decomposition in Probabilistic Graphs
This page was built for software: Pregel