Binary Linear Programming Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replace - " (2006)" to " (2006)")
 
m (Text replacement - ". ---- " to ". ---- ")
 
(12 intermediate revisions by the same user not shown)
Line 1: Line 1:
'''See:''' [[Binary]], [[Linear Programming Algorithm]].
'''See:</B> [[Binary]], [[Linear Programming Algorithm]].
 
----
----
----
----
==References ==
 
===2006===
== References ==
* ([[2006_ABinaryLinProgFormulofGED|Justice & Hero, 2006]]) &rArr; 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]
 
** A [[Binary Linear Programming Algorithm|binary linear programming formulation]] of the [[Graph Edit Distance Function|graph edit distance]] for [[Unweighted Graph|unweighted]], [[Undirected Graph|undirected graphs]] with [[Graph Node Attribute|vertex attributes]] is derived and applied to a [[Graph Recognition Task|graph recognition problem]]. ...
=== 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]
** A [[Binary Linear Programming Algorithm|binary linear programming formulation]] of the [[Graph Edit Distance Function|graph edit distance]] for [[Unweighted Graph|unweighted]], [[Undirected Graph|undirected graphs]] with [[Graph Node Attribute|vertex attributes]] is derived and applied to a [[Graph Recognition Task|graph recognition problem]].


----
----


__NOTOC__
__NOTOC__
[[Category:Stub]]

Latest revision as of 22:12, 16 June 2021