Search: s, Theory, Conference, Wang, J, 1995, 50 - 99

1 result

Results

On the Editing Distance between Undirected Acyclic Graphs and Related Problems

... algorithm has the same asymptotic complexity as Selkow's algorithm. (Selkow's distance measure requires that all node deletions and insertions occur at ...

Publication - huliganka - 04/16/2013 - 06:16 - 0 comments - 0 attachments