This level-5 vital article is ratedC-class on Wikipedia'scontent assessment scale. It is of interest to the followingWikiProjects:

Mathematics This article is within the scope ofWikiProject Mathematics, a collaborative effort to improve the coverage ofmathematics on Wikipedia. If you would like to participate, please visit the project page, where you can jointhe discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics ??? This article has not yet received a rating on theproject's priority scale. Computer scienceLow‑importance This article is within the scope ofWikiProject Computer science, a collaborative effort to improve the coverage ofComputer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can jointhe discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science Low This article has been rated asLow-importance on theproject's importance scale. Things you can helpWikiProject Computer science with: Here are some tasks awaiting attention: Article requests : Requested articles/Applied arts and sciences/Computer science, computing, and Internet Cleanup : Computer science articles needing attention Computer science articles needing expert attention Copyedit : Computing Expand : Computer science Infobox : Computer science articles without infoboxes Maintain : Timeline of computing 2020–present Photo : Find pictures for the biographies of computer scientists (seeList of computer scientists) Computing articles needing images Stubs : Computer science stubs Unreferenced : WikiProject Computer science/Unreferenced BLPs Project-related : Tag all relevant articles inCategory:Computer science and sub-categories with{{WikiProject Computer science}}

Here are suggestions of ways to improve this article:

• Improve the History section. A good reference to use is one that I have already cited in the History and Application sections.

Cai, Jin-Yi; Lu, Pinyan; Xia, Mingji (2010).Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP. Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on. Las Vegas, NV, USA: IEEE.{{cite conference}}:External link in|conferenceurl= (help);Unknown parameter|conferenceurl= ignored (|conference-url= suggested) (help)

• 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 theFKT 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 theFKT 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.

Bender2k14 (talk)12:47, 23 December 2010 (UTC)[reply]

• C-Class level-5 vital articles
• Wikipedia level-5 vital articles in Mathematics
• C-Class vital articles in Mathematics
• C-Class mathematics articles
• Unknown-priority mathematics articles
• C-Class Computer science articles
• Low-importance Computer science articles
• WikiProject Computer science articles

• All Wikipedia vital articles