{"issue":{"created_at":"2011-12-15T17:25:14Z","state":"open","updated_at":"2011-12-15T17:25:14Z","user":{"gravatar_id":"b3384da201ce3640da948ca2fdbaf325","id":1265751,"url":"https://api.github.com/users/gabriel-weaver","avatar_url":"https://secure.gravatar.com/avatar/b3384da201ce3640da948ca2fdbaf325?d=https://a248.e.akamai.net/assets.github.com%2Fimages%2Fgravatars%2Fgravatar-140.png","login":"gabriel-weaver"},"comments":0,"body":"Tim Nelson of WPI and the LISA organizing committee thought it is interesting that tree diff is NP hard.  He thinks that I could get some interesting theoretical meat to our research by considering how it relates to graph isomorphism.\r\n\r\nConversation with Tim Nelson at LISA 2011.","assignee":null,"id":2569762,"labels":[],"number":10,"pull_request":{"patch_url":null,"html_url":null,"diff_url":null},"title":"Graph Isomorphism and Tree Diff","html_url":"https://github.com/gabriel-weaver/Hierarchical-Diff/issues/10","closed_at":null,"url":"https://api.github.com/repos/gabriel-weaver/Hierarchical-Diff/issues/10","milestone":null},"action":"opened"}