"Tight algorithms for connectivity problems parameterized by clique-width."

Falko Hegerfeld, Stefan Kratsch (2023)

Details and statistics

DOI: 10.48550/ARXIV.2302.03627

access: open

type: Informal or Other Publication

metadata version: 2023-02-10

a service of  Schloss Dagstuhl - Leibniz Center for Informatics