Binary Linear Programming Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "== ==" to "== ==") |
m (Text replacement - ". ---- " to ". ---- ") |
||
| Line 1: | Line 1: | ||
'''See:</B> [[Binary]], [[Linear Programming Algorithm]]. | '''See:</B> [[Binary]], [[Linear Programming Algorithm]]. | ||
---- | ---- | ||
---- | ---- | ||
Latest revision as of 22:12, 16 June 2021
See: Binary, Linear Programming Algorithm.
References
2006
- (Justice & Hero, 2006) ⇒ Derek Justice, and Alfred Hero. (2006). “A Binary Linear Programming Formulation of the Graph Edit Distance.” In: IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(8). doi:10.1109/TPAMI.2006.152
- 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. …