Pages that link to "Item:Q1332944"
From MaRDI portal
The following pages link to Persistency in maximum cardinality bipartite matchings (Q1332944):
Displaying 12 items.
- Optimum matchings in weighted bipartite graphs (Q265439) (← links)
- A polynomial algorithm for the extendability problem in bipartite graphs (Q293170) (← links)
- Finding all maximally-matchable edges in a bipartite graph (Q418005) (← links)
- Global constraint catalogue: past, present and future (Q879974) (← links)
- Persistency and matroid intersection (Q1035281) (← links)
- Persistency in the assignment and transportation problems (Q1298743) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Safety in \(s\)-\(t\) paths, trails and walks (Q2118205) (← links)
- Safety and completeness in flow decompositions for RNA assembly (Q2170145) (← links)
- Generalised arc consistency for the AllDifferent constraint: an empirical survey (Q2389692) (← links)
- Persistency in combinatorial optimization problems on matroids (Q5936456) (← links)
- Simplicity in Eulerian circuits: uniqueness and safety (Q6072204) (← links)