"On the Complexity of Finding a Sparse Connected Spanning Subgraph in a ..."

Matthias Bentert, Jannik Schestag, Frank Sommer (2023)

Details and statistics

DOI: 10.48550/ARXIV.2308.04575

access: open

type: Informal or Other Publication

metadata version: 2023-08-22

a service of  Schloss Dagstuhl - Leibniz Center for Informatics