Cited in
(only showing first 100 items - show all)- OpenSHMEM
- Approximating small balanced vertex separators in almost linear time
- Distributed core decomposition in probabilistic graphs
- A survey on the distributed computing stack
- The role of randomness in the broadcast congested clique model
- Personalized PageRank clustering: a graph clustering algorithm based on random walks
- GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
- Find Your Place: Simple Distributed Algorithms for Community Detection
- Fregel
- An algebra for distributed Big Data analytics
- Computing source-to-target shortest paths for complex networks in RDBMS
- Disk-based shortest path discovery using distance index over large dynamic graphs
- libOTe
- DeepLog
- Nethogs
- GossipMap
- PathGraph
- Graph reconstruction in the congested clique
- Fregel: a functional domain-specific language for vertex-centric large-scale graph processing
- Parallelizing sequential graph computations
- Blogel
- GRAPE
- Using compressed suffix-arrays for a compact representation of temporal-graphs
- Gluon
- A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions
- Parallel community detection for massive graphs
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Linear-time parameterized algorithms with limited local resources
- A linear logic programming language for concurrent programming over graph structures
- GPS
- AutoDiagn: An Automated Real-Time Diagnosis Framework for Big Data Systems
- Zabbix
- GoFFish
- An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC
- Modern Datalog Engines
- Distributed balanced partitioning via linear embedding
- An exact combinatorial algorithm for minimum graph bisection
- Asynchronous distributed execution of fixpoint-based computational fields
- Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy
- Axiomatization and characterization of BSP algorithms
- Fast construction of compressed web graphs
- A distributed multilevel force-directed algorithm
- Performing dynamically injected tasks on processes prone to crashes and restarts
- The evolving network model with community size and distance preferences
- Strong simulation: capturing topology in graph pattern matching
- A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph
- Parallel algorithms for flexible pattern matching on big graphs
- Mermaid
- InterViewer
- MapReduce
- PBGL
- DASWAM
- JOSTLE
- KaFFPa
- CDAOstore
- UPC
- MCSTL
- STXXL
- DibaP
- PhyloWS
- Hadoop
- Dryad
- Gplag
- CouchDB
- Graphs
- Jolie
- GraphLab
- WebPIE
- BSP
- DryadOpt
- TALE
- YapOr
- JGroups
- GraphX
- MongoDB
- NESL
- PEGASUS
- PowerGraph
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems
- Giraph
- NeMa
- OpenStack
- KaHIP
- ELF
- AVOCLOUDY
- Green-Marl
- ZooKeeper
- AsterixDB
- GRECS
- CombBLAS
- GASNet
- PARLOG
- Spark
- April
- Elixir
- Kleisli
- BigDatalog
- GiViP
- Graft
- HaLoop
This page was built for software: Pregel
