Sciweavers

Share
PAMI
2006

A Binary Linear Programming Formulation of the Graph Edit Distance

9 years 2 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. A general formulation for editing graphs is used to derive a graph edit distance that is proven to be a metric provided the cost function for individual edit operations is a metric. Then, a binary linear program is developed for computing this graph edit distance, and polynomial time methods for determining upper and lower bounds on the solution of the binary program are derived by applying solution methods for standard linear programming and the assignment problem. A recognition problem of comparing a sample input graph to a database of known prototype graphs in the context of a chemical information system is presented as an application of the new method. The costs associated with various edit operations are chosen by using a minimum normalized variance criterion applied to pairwise distances between nearest...
Derek Justice, Alfred O. Hero
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2006
Where PAMI
Authors Derek Justice, Alfred O. Hero
Comments (0)
books