Pages that link to "Item:Q792885"
From MaRDI portal
The following pages link to An 0(n log n) algorithm for the convex bipartite matching problem (Q792885):
Displaying 11 items.
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- An efficient algorithm for the bipartite matching problem (Q1069866) (← links)
- On the domatic number of interval graphs (Q1111388) (← links)
- A fast bipartite network flow algorithm for selective assembly (Q1273091) (← links)
- The maximum deviation just-in-time scheduling problem. (Q1421459) (← links)
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints (Q1742190) (← links)
- A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs (Q2283031) (← links)
- On compiling structured CNFs to OBDDs (Q2411046) (← links)
- On Compiling Structured CNFs to OBDDs (Q3194709) (← links)