Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

FKT算法 · Vinony

🌐中文

English Français Русский فارسی 한국어 中文日本語

EntityQ5426031· pop 6· linked from 13 articles

FKT算法

algorithm for counting perfect matchings in planar graphs

Available in 6 languages

Français
Русский
Serbian
فارسی
한국어

via Wikidata sitelinks · CC0

Connections

Categories

Graph algorithms Planar graphs

Sources

wikipedia.externallinksexternallink

International Standard Book Number

Entity

digital object identifier

International Standard Serial Number

statistical mechanics

adjacency matrix

diatomic molecule

skew-symmetric matrix

partition function

Sign in to save

What links here13 pages

Tutte polynomial

Harold Neville Vazeille Temperley

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Hopcroft–Karp algorithm

Entitydist 0.39

Gale–Shapley algorithm

Entitydist 0.44

harmonious coloring

Entitydist 0.56

Entitydist 0.59

De Bruijn–Erdős theorem

Entitydist 0.60

Hungarian algorithm

Entitydist 0.61

Entitydist 0.61

diamond-square algorithm

Entitydist 0.62

longest prefix match

Entitydist 0.63

approximate string-matching algorithm

Entitydist 0.63

Correspondence Chess Olympiad

Entitydist 0.63

Entitydist 0.64