Abstract: 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 ...

Abstract: A linear programming (LP) approach is proposed for the weighted graph matching problem. A linear program is obtained by formulating the graph matching problem in L/sub 1/ norm and then ...

This repository contains the code and the data used for the experiments in the paper "Rule Induction in Knowledge Graphs Using Linear Programming" by Sanjeeb Dash and Joao Goncalves, AAAI-23. The code ...

All references mentioned in Class 2 use linear goal programming (GP). GP uses the following steps 12 to find ‘best possible’ (that is, Pareto-optimal) diets for problems in Class 2a ...