Random Graph Generation in Context-Free Graph Languages
<|reference_start|>Random Graph Generation in Context-Free Graph Languages: 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.<|reference_end|>
@article{vastarini2024random,
    title={Random Graph Generation in Context-Free Graph Languages},
    author={Federico Vastarini (University of York), Detlef Plump (University of
  York)},
    journal={EPTCS 408, 2024, pp. 107-120},
    year={2024},
    doi={10.4204/EPTCS.408.7},
    archivePrefix={arXiv},
    eprint={2410.00541},
    primaryClass={cs.LO cs.FL}
}