Random graph generation in context-free graph languages

DOI10.4204/EPTCS.408.7MaRDI QIDQ6934054zbMATH OpenFDO

Authors Federico Vastarini, Detlef Plump

Publication date 3 September 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.408.7

Mathematics Subject Classification ID

Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Cites work

• A quasi-polynomial-time algorithm for sampling words from a context-free language
• An axiomatic definition of context-free rewriting and its application to NLC graph grammars
• Candidate one-way functions based on expander graphs
• Generating words in a context-free language uniformly at random
• Handbook of Graph Grammars and Computing by Graph Transformation
• scientific article; zbMATH DE number 2079931 (Why is no real title available?)
• scientific article; zbMATH DE number 1437942 (Why is no real title available?)
• On certain formal properties of grammars

This page was built for publication: Random graph generation in context-free graph languages

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