Measuring the Similarity of Geometric Graphs

What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer linear program. We also present experiments using a heuristic distance function.

• Type: Conference
• Year: 2009
• Where: WEA
• Authors: Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn
• Keywords: Algorithms, Geometric Graphs, Heuristic Distance Function, Integer Linear Program, WEA 2009