"Perfectly Matched Sets in Graphs: Hardness, Kernelization Lower Bound, and ..."

N. R. Aravind, Roopam Saxena (2021)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2021-07-22

a service of  Schloss Dagstuhl - Leibniz Center for Informatics