Random Graph Generation in Context-Free Graph Languages
Logic in Computer Science
2024-10-02 v1 Formal Languages and Automata Theory
Abstract
We present a method for generating random hypergraphs in context-free hypergraph languages. It is obtained by adapting Mairson's generation algorithm for context-free string grammars to the setting of hyperedge replacement grammars. Our main results are that for non-ambiguous hyperedge replacement grammars, the method generates hypergraphs uniformly at random and in quadratic time. We illustrate our approach by a running example of a hyperedge replacement grammar generating term graphs.
Cite
@article{arxiv.2410.00541,
title = {Random Graph Generation in Context-Free Graph Languages},
author = {Federico Vastarini and Detlef Plump},
journal= {arXiv preprint arXiv:2410.00541},
year = {2024}
}
Comments
In Proceedings DCM 2023, arXiv:2409.19298