{"version":"1.0","type":"link","title":"FKT algorithm - Newikis","description":"The Fisher–Kasteleyn–Temperley (FKT) 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. For matchings that are not required to be perfect,…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}