Pages that link to "Item:Q4888367"

The following pages link to ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS (Q4888367):

Displaying 9 items.

• Tree edit distance and maximum agreement subtree (Q458389) (← links)
• Space efficient algorithms for ordered tree comparison (Q930598) (← links)
• Cost and accuracy aware scientific workflow retrieval based on distance measure (Q1749198) (← links)
• Tai mapping hierarchy for rooted labeled trees through common subforest (Q2398215) (← links)
• A comparative analysis of multidimensional features of objects resembling sets of graphs (Q2474878) (← links)
• Constrained tree inclusion (Q2569419) (← links)
• TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE (Q2929619) (← links)
• Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees (Q3011871) (← links)
• Finding approximate patterns in undirected acyclic graphs (Q5959618) (← links)