"Dörfler marking with minimal cardinality is a linear complexity problem."

Carl-Martin Pfeiler, Dirk Praetorius (2019)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2019-08-02

a service of  Schloss Dagstuhl - Leibniz Center for Informatics