10 citations · 10 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance
Xiao Mao
The (unweighted) tree edit distance problem for node trees asks to compute a measure of dissimilarity between two rooted trees with node labels. The current best algorithm from…
cs.DS2021
Shortest non-separating st-path on chordal graphs
Xiao Mao
Many NP-Hard problems on general graphs, such as maximum independence set, maximal cliques and graph coloring can be solved efficiently on chordal graphs. In this paper, we explore…