Exact GED: Revision history

28 April 2023

• curprev 09:0909:09, 28 April 2023‎ Admin talk contribs‎ 1,601 bytes −215‎ No edit summary

10 April 2023

• curprev 08:2108:21, 10 April 2023‎ Admin talk contribs‎ 1,816 bytes +6‎ No edit summary

15 February 2023

• curprev 14:4514:45, 15 February 2023‎ Admin talk contribs‎ 1,810 bytes −13‎ No edit summary
• curprev 14:3714:37, 15 February 2023‎ Admin talk contribs‎ 1,823 bytes −2‎ No edit summary
• curprev 13:0413:04, 15 February 2023‎ Admin talk contribs‎ 1,825 bytes +14‎ No edit summary
• curprev 12:0212:02, 15 February 2023‎ Admin talk contribs‎ 1,811 bytes −11‎ No edit summary

• curprev 10:2210:22, 15 February 2023‎ Admin talk contribs‎ 1,822 bytes +1,822‎ Created page with "{{DISPLAYTITLE:Exact GED (Graph Edit Distance Computation)}} == Description == The GED of two graphs is defined as the minimum cost of an edit path between them, where an edit path is a sequence of edit operations (inserting, deleting, and relabeling vertices or edges) that transforms one graph into another. Exact GED computes the GED exactly. == Related Problems == Related: Inexact GED == Parameters == <pre>V: number of vertices in the larger of the two grap..."