Pregel

swMATH13416MaRDI QIDQ25330FDOQ25330

Author name not available (Why is that?)

Cited In (38)

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

This page was built for software: Pregel