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 15 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)
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) (Q751274) (← links)
- Reconstruction of domino tilings -- combinatorial and probabilistic questions (Q897580) (← links)
- Computing asymmetric median tree of two trees via better bipartite matching algorithm (Q1642720) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- Finding a maximum matching in a permutation graph (Q1902306) (← 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)
- Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs (Q4608650) (← links)
- Sequential importance sampling for estimating expectations over the space of perfect matchings (Q6103989) (← links)
- Efficiently-verifiable strong uniquely solvable puzzles and matrix multiplication (Q6591619) (← links)
