DSPFP
This is a Python implementation of the Doubly Stochastic Projected Fixed Point (DSPFP) algorithm for solving the Quadratic Assignment Problem / Graph Matching..
Install / Use
/learn @emanuele/DSPFPREADME
DSPFP
This is a Python implementation of the Doubly Stochastic Projected Fixed Point (DSPFP) algorithm for the approximate solution of the Quadratic Assignment Problem (QAP) / Graph Matching (GM). the DSPFP was proposed in:
Yao Lu, Kaizhu Huang, and Cheng-Lin Liu. Doubly stochastic projected Fixed-Point algorithm for large graph matching. Pattern Recognition, July 2016.
http://dx.doi.org/10.1016/j.patcog.2016.07.015
Related pre-print, from 2012, where the same algorithm was named fastPFP:
https://arxiv.org/abs/1207.1114
Related Skills
node-connect
343.1kDiagnose OpenClaw node connection and pairing failures for Android, iOS, and macOS companion apps
claude-opus-4-5-migration
90.0kMigrate prompts and code from Claude Sonnet 4.0, Sonnet 4.5, or Opus 4.1 to Opus 4.5
frontend-design
90.0kCreate distinctive, production-grade frontend interfaces with high design quality. Use this skill when the user asks to build web components, pages, or applications. Generates creative, polished code that avoids generic AI aesthetics.
model-usage
343.1kUse CodexBar CLI local cost usage to summarize per-model usage for Codex or Claude, including the current (most recent) model or a full model breakdown. Trigger when asked for model-level usage/cost data from codexbar, or when you need a scriptable per-model summary from codexbar cost JSON.
