scientific article
From MaRDI portal
Publication:3731028
zbMath0597.68035MaRDI QIDQ3731028
Ernst W. Mayr, David P. Helmbold
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Computing the bump number with techniques from two-processor scheduling ⋮ Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs ⋮ Matching and multidimensional matching in chordal and strongly chordal graphs ⋮ Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality ⋮ Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem
