Two monads for graphs

04/25/2018
by   Mikołaj Bojańczyk, et al.
0

An introduction to algebras for graphs, based on Courcelle's algebras of hyperedge replacement and vertex replacement. The paper uses monad notation.

READ FULL TEXT

page 11

page 13

page 16

page 19

research
06/04/2020

Hash Cracking Benchmarking of Replacement Patterns

In this paper, we explain our methodology to identify replacement patter...
research
03/21/2023

Dynamic Vertex Replacement Grammars

Context-free graph grammars have shown a remarkable ability to model str...
research
01/04/2019

Star sampling with and without replacement

Star sampling (SS) is a random sampling procedure on a graph wherein eac...
research
10/26/2018

Testing Exponentiality Against a Trend Change in Mean Time to Failure in Age Replacement

Mean time to failure in age replacement evaluates the performance and ef...
research
11/23/2020

Effectiveness of MPC-friendly Softmax Replacement

Softmax is widely used in deep learning to map some representation to a ...
research
06/07/2020

Realistic text replacement with non-uniform style conditioning

In this work, we study the possibility of realistic text replacement, th...
research
05/03/2022

A Model of Fluid-Structure and Biochemical Interactions with Applications to Subclinical Leaflet Thrombosis

Subclinical leaflet thrombosis (SLT) is a potentially serious complicati...

Please sign up or login with your details

Forgot password? Click here to reset