Pages that link to "Item:Q418005"
From MaRDI portal
The following pages link to Finding all maximally-matchable edges in a bipartite graph (Q418005):
Displaying 9 items.
- Optimum matchings in weighted bipartite graphs (Q265439) (← links)
- Addendum to ``Finding all maximally-matchable edges in a bipartite graph'' (Q387819) (← links)
- Privacy by diversity in sequential releases of databases (Q528678) (← links)
- Reconstruction of domino tilings -- combinatorial and probabilistic questions (Q897580) (← links)
- Permanents, \(\alpha\)-permanents and Sinkhorn balancing (Q2259826) (← links)
- Recomputing causality assignments on lumped process models when adding new simplification assumptions (Q2331813) (← links)
- Generic pole assignability, structurally constrained controllers and unimodular completion (Q2435587) (← links)
- The graphs of stably matchable pairs (Q2672447) (← links)
- Sequential importance sampling for estimating expectations over the space of perfect matchings (Q6103989) (← links)
