The following pages link to (Q3731028):
Displayed 5 items.
- Computing the bump number with techniques from two-processor scheduling (Q1106865) (← links)
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245) (← links)
- Matching and multidimensional matching in chordal and strongly chordal graphs (Q1392565) (← links)
- Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality (Q6184389) (← links)