"d-collapsibility is NP-complete for d greater or equal to 4."

Martin Tancer (2010)

Details and statistics

DOI:

access: open

type: Journal Article

metadata version: 2021-02-11

a service of  Schloss Dagstuhl - Leibniz Center for Informatics