Pages that link to "Item:Q2848226"
From MaRDI portal
The following pages link to Perfect matchings in \(O(n\log n)\) time in regular bipartite graphs (Q2848226):
Displaying 13 items.
- Optimum distance flag codes from spreads via perfect matchings in graphs (Q825551) (← links)
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245) (← links)
- A simple matching algorithm for regular bipartite graphs. (Q1853135) (← links)
- Fair-by-design matching (Q2212506) (← links)
- Perfect matchings in \(\tilde{O}(n^{1.5})\) time in regular bipartite graphs (Q2322505) (← links)
- Recomputing causality assignments on lumped process models when adding new simplification assumptions (Q2331813) (← links)
- The optimal tenement allocation for reducing traffic burden (Q2630839) (← links)
- Perfect matchings in \(O(n \log n)\) time in regular bipartite graphs (Q2875130) (← links)
- Formalizing randomized matching algorithms (Q2904622) (← links)
- On Rearrangement of Items Stored in Stacks (Q3382003) (← links)
- Average-case analysis of algorithms for matchings and related problems (Q4327634) (← links)
- MAXIMUM MATCHINGS IN A PSEUDOFRACTAL SCALE-FREE WEB (Q5086261) (← links)
- (Q5874548) (← links)