Finding a minimum spanning tree with a small non-terminal set

DOI10.1016/J.TCS.2025.115092MaRDI QIDQ7021844zbMATH OpenFDO

Authors Tesshu Hanaka, Yasuaki Kobayashi

Publication date 26 February 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

fixed-parameter algorithmsparameterized complexitykernelizationspanning tree

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Finding a minimum spanning tree with a small non-terminal set

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