matchings-in-biparite-graphs
CommunityMaster bipartite matching proofs and algorithms.
AuthorArcadi4
Version1.0.0
Installs0
System Documentation
What problem does it solve?
Classifies and applies the correct bipartite matching model (cardinality, stable, or weighted assignment) and uses the appropriate certificate to reason about correctness, including the essential proof moves and implementation contracts.
Core Features & Use Cases
- Guidance on model selection (cardinality, stable matching, weighted assignment) and the corresponding certificates.
- Instruction on matching proofs (augmenting paths, blocking pairs, feasible labels) and how to translate textbook results into contracts for code.
- Clear guidelines to separate textbook reasoning from production code choices, including when to avoid flow reductions.
Quick Start
Explore a representative bipartite problem by applying the chapter's models and certificates to determine the right approach.
Dependency Matrix
Required Modules
None requiredComponents
Standard package💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: matchings-in-biparite-graphs Download link: https://github.com/Arcadi4/nerdy/archive/main.zip#matchings-in-biparite-graphs Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 471,000+ vetted skills library on demand.