Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs

Boris Klemz, Günter Rote. Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs. Algorithmica, 84(4):1064-1080, 2022. [doi]

Authors

Boris Klemz

This author has not been identified. Look up 'Boris Klemz' in Google

Günter Rote

This author has not been identified. Look up 'Günter Rote' in Google