ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
From MaRDI portal
Publication:4888367
DOI10.1142/S0129054196000051zbMATH Open0852.68067OpenAlexW2163509192MaRDI QIDQ4888367FDOQ4888367
Authors: Kaizhong Zhang, Jason T. L. Wang, Dennis Shasha 
Publication date: 26 November 1996
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054196000051
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
Graph theory (including graph drawing) in computer science (68R10) Statistical distribution theory (62E99)
Cited In (11)
- Finding approximate patterns in undirected acyclic graphs
- Improved MAX SNP-hard results for finding an edit distance between unordered trees
- A local branching heuristic for solving a graph edit distance problem
- Cost and accuracy aware scientific workflow retrieval based on distance measure
- Tree edit distance and maximum agreement subtree
- On the edit distance of powers of cycles
- Tai mapping hierarchy for rooted labeled trees through common subforest
- Space efficient algorithms for ordered tree comparison
- Tractable and intractable variations of unordered tree edit distance
- Constrained tree inclusion
- A comparative analysis of multidimensional features of objects resembling sets of graphs
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)
