Many practical computing problems concern large graphs. Standard examples include the
Web graph and various social networks. The scale of these graphs-in some cases billions of …

Programming geo-replicated distributed systems is challenging given the complexity of
reasoning about different evolving states on different replicas. Existing approaches to this …

Graph mining is currently the focus of intense research. Major driving factors include social
media, opinion mining, and the schemaless noSQL databases. Time evolving or dynamic …

The paper presents a minimalistic and elegant approach to working with graphs in Haskell. It
is built on a rigorous mathematical foundation---an algebra of graphs---that allows us to …

This paper presents a new functional programming model for graph structures called
structured graphs. Structured graphs extend conventional algebraic datatypes with explicit …

The vertex-centric programming model, known as “think like a vertex”, is being used more
and more to support various big graph processing methods through iterative supersteps that …

This paper details the design and implementation of OCAMLGRAPH, a highly generic graph
library for the programming language OCAML. This library features a large set of graph data …

We present an efficient, modular, and feature-rich framework for automated generation and
validation of complex structures, suitable for tasks that explore a large space of structured …

Graphs and their algorithms are fundamental to computer science, but they can be difficult to
formalise, especially in dependently-typed proof assistants. Part of the problem is that …

Resolving conflicting graph mutations in a distributed computing system. Graph data for at
least a partition of a graph is stored in a worker system of a distributed computing system …