MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters

DOI10.1007/978-3-642-41036-9_9MaRDI QIDQ5168515zbMATH OpenOpenAlexFDO

Authors Carlo Bellettini, Matteo Camilli, L. Capra, Mattia Monga

Publication date 7 July 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-41036-9_9

zbMATH Keywords

big datacloud computingdistributed computingformal methodsMapReducereachability graph

Mathematics Subject Classification ID

Internet topics (68M11) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Recommendations

• O'Reach: Even Faster Reachability in Large Graphs
• Parallel processing of graph reachability in databases
• Reachability in big graphs: a distributed indexing and querying approach
• A distributed algorithm for GSPN reachability graph generation
• Distributed graph traversals by relabelling systems with applications
• On the parallel complexity of digraph reachability
• Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms

Cited in

(1)

• MaRDiGraS

Describes a project that uses

Uses Software

• GreatSPN
• Hadoop
• PIPE2
• Twister

This page was built for publication: MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168515)