Sign inGet started
Paper · arXiv

ReLU Networks for Exact Generation of Similar Graphs

Generation of graphs constrained by a specified graph edit distance from a source graph is important in applications such as cheminformatics, network anomaly synthesis, and structured data augmentation. Despite the growing demand for such constrained generative models in areas including molecule design and network perturbation analysis, the neural architectures required to provably generate graphs within a bounded graph edit distance remain largely unexplored. In addition, existing graph generative models are predominantly data-driven and depend heavily on the availability and quality of training data, which may result in generated graphs that do not satisfy the desired edit distance cons...

AuthorsMamoona Ghafoor, Tatsuya Akutsu
Primary categorycs.LG
Published7 April 2026
Last updated at source7 April 2026
cs.LGcs.AIcs.DM
Embed this entry
<iframe src="https://silytics.si/embed/item/a34523d7-68e6-4c73-a276-ca8b907eeecb" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.