Binary Linear Programming Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replace - " (2006)" to " (2006)") |
No edit summary |
||
| Line 10: | Line 10: | ||
__NOTOC__ | __NOTOC__ | ||
[[Category:Stub]] | |||
Revision as of 05:59, 4 November 2013
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. ...