Author

Maximilian Limmer

View on Semantic Scholar

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Jul 2026

On the Complexity of Graph Edit Distance in Restricted Graph Classes

It is proved that both the maximum common edge subgraph and the graph edit distance remain NP-hard, even when both graphs are paths, even when one graph is a path and the other is a tree.

Maximilian Limmer, Nils M. Kriege · 0 citations