Exact graph edit distance can be computed in O*((4+eps)^n) time and polynomial space whenever one input graph has strictly sublinear balanced separators.
A graph database repository and performance evaluation metrics for graph edit distance
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A Separator-based Algorithm for the Graph Edit Distance Problem
Exact graph edit distance can be computed in O*((4+eps)^n) time and polynomial space whenever one input graph has strictly sublinear balanced separators.