Timeline for Extending ordered tree edit distance to DAGs
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 8, 2019 at 19:47 | comment | added | Martin Modrák | @mhn_namak Then no, I don't have this. My buest guess is that since it is NP-hard you might as well just directly search the space generated by edit operations. Even simple algs (A*/iterative deepening/branch and bound/MCTS) might be close to best possible option. | |
| Aug 8, 2019 at 19:22 | comment | added | mhn_namak | either an algorithm/paper that solves this problem or even better a code package :). | |
| Aug 6, 2019 at 5:41 | comment | added | Martin Modrák | @mhn_namak What updates are you seeking? My conclusion is that the problem is NP hard and I still believe this conclusion. | |
| Jul 22, 2019 at 22:11 | comment | added | mhn_namak | Hey @Martin, do you have more updates on this? | |
| Mar 30, 2018 at 8:59 | vote | accept | Martin Modrák | ||
| Nov 28, 2017 at 8:17 | history | answered | Martin Modrák | CC BY-SA 3.0 |