A Persistence-Driven Edit Distance for Graphs with Abstract Weights
From MaRDI portal
Abstract: In this work we define a novel edit distance for graphs considered with some weights on the edges. The metric is driven by the idea of considering graphs as topological summaries in the context of persistence and topological data analysis. Several examples related to (one and multidimensional) persistent sets are presented. In case the graphs are trees, the metric can be computed with a dynamical binary linear programming approach. This framework is applied and further studied in other works focused on merge trees, where stability properties are also assessed.
This page was built for publication: A Persistence-Driven Edit Distance for Graphs with Abstract Weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6434115)
