Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5426031> ?p ?o }
Showing triples 1 to 48 of
48
with 100 triples per page.
- Q5426031 subject Q7007191.
- Q5426031 subject Q7216428.
- Q5426031 abstract "The FKT algorithm, named after Fisher, Kasteleyn, and Temperley, counts the number of perfect matchings in a planar graph in polynomial time. This same task is #P-complete for general graphs. Counting the number of matchings, even for planar graphs, is also #P-complete. The key idea is to convert the problem into a Pfaffian computation of a skew-symmetric matrix derived from a planar embedding of the graph. The Pfaffian of this matrix is then computed efficiently using standard determinant algorithms.".
- Q5426031 wikiPageExternalLink matchings.pdf.
- Q5426031 wikiPageExternalLink 02whole.pdf.
- Q5426031 wikiPageWikiLink Q1064405.
- Q5426031 wikiPageWikiLink Q1065144.
- Q5426031 wikiPageWikiLink Q1189744.
- Q5426031 wikiPageWikiLink Q1322138.
- Q5426031 wikiPageWikiLink Q1364884.
- Q5426031 wikiPageWikiLink Q141488.
- Q5426031 wikiPageWikiLink Q159430.
- Q5426031 wikiPageWikiLink Q166507.
- Q5426031 wikiPageWikiLink Q1751859.
- Q5426031 wikiPageWikiLink Q178546.
- Q5426031 wikiPageWikiLink Q188715.
- Q5426031 wikiPageWikiLink Q21042776.
- Q5426031 wikiPageWikiLink Q2294516.
- Q5426031 wikiPageWikiLink Q230963.
- Q5426031 wikiPageWikiLink Q2329.
- Q5426031 wikiPageWikiLink Q3710553.
- Q5426031 wikiPageWikiLink Q4200699.
- Q5426031 wikiPageWikiLink Q45715.
- Q5426031 wikiPageWikiLink Q526790.
- Q5426031 wikiPageWikiLink Q531306.
- Q5426031 wikiPageWikiLink Q547823.
- Q5426031 wikiPageWikiLink Q5597085.
- Q5426031 wikiPageWikiLink Q584521.
- Q5426031 wikiPageWikiLink Q5884100.
- Q5426031 wikiPageWikiLink Q6478447.
- Q5426031 wikiPageWikiLink Q6497118.
- Q5426031 wikiPageWikiLink Q7007191.
- Q5426031 wikiPageWikiLink Q7192796.
- Q5426031 wikiPageWikiLink Q7216428.
- Q5426031 wikiPageWikiLink Q727035.
- Q5426031 wikiPageWikiLink Q7857001.
- Q5426031 wikiPageWikiLink Q826467.
- Q5426031 wikiPageWikiLink Q831672.
- Q5426031 wikiPageWikiLink Q837902.
- Q5426031 wikiPageWikiLink Q841545.
- Q5426031 wikiPageWikiLink Q846354.
- Q5426031 wikiPageWikiLink Q875276.
- Q5426031 wikiPageWikiLink Q913598.
- Q5426031 wikiPageWikiLink Q92702.
- Q5426031 wikiPageWikiLink Q949972.
- Q5426031 wikiPageWikiLink Q970152.
- Q5426031 comment "The FKT algorithm, named after Fisher, Kasteleyn, and Temperley, counts the number of perfect matchings in a planar graph in polynomial time. This same task is #P-complete for general graphs. Counting the number of matchings, even for planar graphs, is also #P-complete. The key idea is to convert the problem into a Pfaffian computation of a skew-symmetric matrix derived from a planar embedding of the graph.".
- Q5426031 label "FKT algorithm".