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.
2019
2019
In this paper, we propose a new discriminative clustering method for tensor data. In our method, the tensor data is represented… 
2017
2017
© 2017 The Authors. Atmospheric parameters and chemical compositions for 10 stars with metallicities in the region of -2.2 < [Fe… 
2016
2016
The Fermi kinetics transport model is combined with Maxwell's full wave vector field equations to accurately simulate a GaN high… 
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…