Talk:FKT algorithm
Latest comment: 13 years ago by Bender2k14 in topic Suggestions for Improvement
 | This  level-5 vital article is rated C-class on Wikipedia's content assessment scale.It is of interest to the following WikiProjects: | |||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||
Suggestions for Improvement
editHere 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=|conferenceurl=ignored (|conference-url=suggested) (help)
- 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.
- 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.