×
Please click
here
if you are not redirected within a few seconds.
All
Images
Videos
News
Maps
Shopping
Books
Search tools
Any time
Any time
Past hour
Past 24 hours
Past week
Past month
Past year
All results
All results
Verbatim
FKT algorithm
The Fisher–Kasteleyn–Temperley algorithm, named after Michael Fisher, Pieter Kasteleyn, and Neville Temperley, counts the number of perfect matchings in a planar graph in polynomial time. This same task is #P-complete for general graphs.
Wikipedia