Binary Linear Programming Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replacement - "---- ---- ==" to "---- ---- ==")
m (Text replacement - "== ==" to "== ==")
Line 4: Line 4:


== References ==
== References ==
=== 2006 ===
=== 2006 ===
* ([[2006_ABinaryLinProgFormulofGED|Justice & Hero, 2006]]) ⇒ Derek Justice, and Alfred Hero. ([[2006]]). “[http://www.eecs.umich.edu/~hero/Preprints/gedPAMI2_final.pdf A Binary Linear Programming Formulation of the Graph Edit Distance].” In: [[IEEE Transactions on Pattern Analysis and Machine Intelligence]], 28(8). [http://dx.doi.org/10.1109/TPAMI.2006.152 doi:10.1109/TPAMI.2006.152]
* ([[2006_ABinaryLinProgFormulofGED|Justice & Hero, 2006]]) ⇒ Derek Justice, and Alfred Hero. ([[2006]]). “[http://www.eecs.umich.edu/~hero/Preprints/gedPAMI2_final.pdf A Binary Linear Programming Formulation of the Graph Edit Distance].” In: [[IEEE Transactions on Pattern Analysis and Machine Intelligence]], 28(8). [http://dx.doi.org/10.1109/TPAMI.2006.152 doi:10.1109/TPAMI.2006.152]

Revision as of 17:35, 26 February 2021