Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Shay Mozes, Benjamin Rossman, and Oren Weimann, “An optimal decomposition algorithm for tree edit distance”, ACM Transactions on Algorithms, volume 6, number 1, December 2009, 2:1–2:19.

BibTeX

@Article{TreeEdit_TAlg,
  AUTHOR        = {Erik D. Demaine and Shay Mozes and Benjamin Rossman and Oren Weimann},
  TITLE         = {An optimal decomposition algorithm for tree edit distance},
  JOURNAL       = {ACM Transactions on Algorithms},
  journalurl    = {http://www.acm.org/talg/},
  VOLUME        = 6,
  NUMBER        = 1,
  PAGES         = {2:1--2:19},
  MONTH         = {December},
  YEAR          = 2009,

  replaces      = {TreeEdit_ICALP2007},
  papers        = {TreeEdit_ICALP2007},
  doi           = {https://dx.doi.org/10.1145/1644015.1644017},
  dblp          = {https://dblp.org/rec/journals/talg/DemaineMRW09},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.1145/1644015.1644017">ACM</A>.},
}

Comments:

This paper is also available from ACM.

Availability:

Currently unavailable. If you are in a rush for copies, contact me.

[Google Scholar search]

Related papers:

TreeEdit_ICALP2007 (An Optimal Decomposition Algorithm for Tree Edit Distance)