Determines the edit distance functions for word-representable graphs, k-word-representable graphs, and comparability graphs, with maxima n²/8-o(n²) and 5n²/32-o(n²).
Martin, The edit distance in graphs: methods, results, and generalizations.Recent trends in combinatorics, 31–62.IMA Vol
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The edit distance of word-representable and comparability graphs
Determines the edit distance functions for word-representable graphs, k-word-representable graphs, and comparability graphs, with maxima n²/8-o(n²) and 5n²/32-o(n²).