Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs

MaRDI QIDQ7197073arXivFDO

Authors Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas, Georg Tennigkeit

Publication date 2025

Published in arXiv

arXiv classification

cs.DS

This page was built for publication: Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs

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