On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem.

Anders Dessmark, Andrzej Lingas, Oscar Garrido

Browse the full MFCS paper archive.