Codes and Expansions (CodEx) Seminar

Elena (Xinyi) Wang (TU Graz):
Comparing Embedded Graphs via the Labeled Merge Tree Distance

Geometric graphs appear in many real-world datasets, such as road networks, writing systems, and electrical circuits. We investigate the notion of distance between graphs and present a dissimilarity function to measure the distance between two geometric graphs via the directional transform combined with the labeled merge tree distance. Our distance is not only reflective of the information from the input graphs, but also can be computed in polynomial time. We illustrate its utility by implementation on a Passiflora leaf dataset.