Timeline for Examples of Finite State Machines
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 5, 2013 at 3:31 | comment | added | ocodo | @philosodad I assumed as much, but I dislike posting assumptions. | |
| Jan 5, 2013 at 1:17 | comment | added | philosodad | @slomojo The "G" is for "Generalized", the sequential algorithm from which this is derived uses a technique called generalized maximal matching. | |
| Dec 13, 2012 at 9:18 | comment | added | ocodo | @EvanPlaice it's Distributed Maximal-Matching-based Minimum-Weighted Vertex Cover Algorithm (DGMM) ... a slightly abbreviated acronym, don't ask me where the G comes from. | |
| S Feb 15, 2011 at 8:53 | history | suggested | ocodo | CC BY-SA 2.5 |
fixed image
|
| Feb 15, 2011 at 7:38 | review | Suggested edits | |||
| S Feb 15, 2011 at 8:53 | |||||
| Feb 15, 2011 at 7:10 | review | Suggested edits | |||
| Feb 15, 2011 at 7:11 | |||||
| Feb 14, 2011 at 21:41 | history | answered | philosodad | CC BY-SA 2.5 |