Skip to search formSkip to main contentSkip to account menu

FKT algorithm

Known as: FKT 
The FKT algorithm, named after Fisher, Kasteleyn, and Temperley, counts the number of perfect matchings in a planar graph in polynomial time. This… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
En ingenierie sismique, il est admis que le comportement d’une structure soumise a de forts seismes soit caracterise par des… 
2016
2016
The Fermi kinetics transport model is combined with Maxwell's full wave vector field equations to accurately simulate a GaN high… 
2014
2014
The goal of a target detection system is to determine the location of potential targets in the field of view of the sensor… 
2013
2013
Alkyl cyclohexanes are important components in gasoline, diesel, and jet fuels. With the recent introduction of oil-sand derived… 
2011
2011
..................................................................................................... ii ACKNOWLEDGEMENTS… 
2006
2006
The Fisher Linear Discriminant (FLD) is commonly used in pattern recognition. It finds a linear subspace that maximally separates… 
2005
2005
In this paper, we propose the Fukunaga-Koontz Trans- form (FKT) as applied to Small-Sample Size (SSS) problems and formulate a…