This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of
mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join
the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of
Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join
the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles
Add to The Algorithm section a gif showing how steps 1 - 6 work. Pictures similar to those from the external link (provided below) would work well.
Presentation by Ashley Montanaro about the
FKT algorithm
Add a Proof of Correctness section that...proves why the algorithm is correct. A good starting reference for this is (also) the external link.
Presentation by Ashley Montanaro about the
FKT algorithm
Possibly add to the Generalization section content from the following paper.
Little, C. H. C. (1974), "An extension of Kasteleyn's method of enumerating the 1-factors of planar graphs", in Holton, D. (ed.), Proc. 2nd Australian Conf. Combinatorial Mathematics, Lecture Notes in Mathematics, vol. 403, Springer-Verlag, pp. 63–72.