The complexity of tree partitioning

DOI10.1007/S00453-020-00701-XMaRDI QIDQ6830415zbMATH OpenFDO

Authors Zhao An, Qilong Feng, Iyad Kanj, Ge Xia

Publication date 3 September 2020

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00453-020-00701-X

zbMATH Keywords

parameterized complexitysubexponential-time algorithmstree partitioning

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

This page was built for publication: The complexity of tree partitioning

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