"On some hard and some tractable cases of the maximum acyclic matching problem."

Maximilian Fürst, Dieter Rautenbach (2019)

Details and statistics

DOI: 10.1007/S10479-019-03311-1

access: closed

type: Journal Article

metadata version: 2020-08-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics