ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
From MaRDI portal
Publication:4888367
Recommendations
- On the editing distance of graphs
- The edit distance in graphs: methods, results, and generalizations
- A survey of graph edit distance
- An edit distance between graph correspondences
- The edit distance function of some graphs
- On the edit distance from \(K_{2,t}\)-free graphs
- On the editing distance between unordered labeled trees
- Exact computation of graph edit distance for uniform and non-uniform metric edit costs
- On the edit distance function of the random graph
Cited in
(12)- Space efficient algorithms for ordered tree comparison
- Tai mapping hierarchy for rooted labeled trees through common subforest
- A comparative analysis of multidimensional features of objects resembling sets of graphs
- Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
- Finding approximate patterns in undirected acyclic graphs
- Cost and accuracy aware scientific workflow retrieval based on distance measure
- Improved MAX SNP-hard results for finding an edit distance between unordered trees
- Tractable and intractable variations of unordered tree edit distance
- A local branching heuristic for solving a graph edit distance problem
- Constrained tree inclusion
- On the edit distance of powers of cycles
- Tree edit distance and maximum agreement subtree
This page was built for publication: ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888367)
