Sciweavers

226 search results - page 46 / 46
» Lower bounds on the obstacle number of graphs
Sort
View
JCB
2006
115views more  JCB 2006»
13 years 5 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger