Parameterized complexity of non-separating and non-disconnecting paths and sets

DOI10.4230/LIPICS.MFCS.2022.6MaRDI QIDQ6583997zbMATH OpenFDO

Authors Ankit Abhinav, Susobhan Bandopadhyay, Aritra Banik, Yasuaki Kobayashi, Shunsuke Nagano, Yota Otachi, Saket Saurabh

Publication date 6 August 2024

zbMATH Keywords

parameterized complexitynon-separating path

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Parameterized complexity of non-separating and non-disconnecting paths and sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6583997)