Measuring the Similarity of Geometric Graphs

14 years 1 months ago

Download www.inf.fu-berlin.de

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.

Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim,

Real-time Traffic

Algorithms | Geometric Graphs | Heuristic Distance Function | Integer Linear Program | WEA 2009 |

claim paper

» Matching planar maps

» Probabilistic vs Geometric Similarity Measures for Image Retrieval

» Algorithms for Computing Geometric Measures of Melodic Similarity

» On Combining Textural and Geometrical Scores for Discriminative Face Authentication

» Learning Graph Walk Based Similarity Measures for Parsed Text

» A User Study in Similarity Measures for Graph Drawing

» Reactive Tabu Search for Measuring Graph Similarity

» MetricsBased 3D Visualization of Large ObjectOriented Programs

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	WEA
Authors	Otfried Cheong, Joachim Gudmundsson, Hyo-Sil Kim, Daria Schymura, Fabian Stehn

Comments (0)

Sciweavers

Measuring the Similarity of Geometric Graphs

Algorithms | Geometric Graphs | Heuristic Distance Function | Integer Linear Program | WEA 2009 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers