The following pages link to Uncrossing a family of set-pairs (Q873653):
Displaying 8 items.
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- Packing and covering of crossing families of cuts (Q789399) (← links)
- An algorithm to increase the node-connectivity of a digraph by one (Q955325) (← links)
- How to tidy up a symmetric set-system by use of uncrossing operations (Q1351503) (← links)
- Restricted \(t\)-matchings in bipartite graphs (Q1410687) (← links)
- Tree-compositions and orientations (Q2450662) (← links)
- On uncrossing games for skew-supermodular functions (Q2825681) (← links)
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs (Q3503840) (← links)
