The parameterized complexity of finding minimum bounded chains

DOI10.1016/J.COMGEO.2024.102102MaRDI QIDQ6577440zbMATH OpenFDO

Authors Nello Blaser, Morten Brun, Lars M. Salbu, Erlend Raa Vågset

Publication date 23 July 2024

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COMGEO.2024.102102

zbMATH Keywords

computational topologytopological data analysistreewidthcomplexity theoryparameterized algorithmsminimum bounded chain

Mathematics Subject Classification ID

Theory of computing (68Qxx) Graph theory (05Cxx) General and miscellaneous specific topics (00Axx)

Cites work

• scientific article; zbMATH DE number 6783432 (Why is no real title available?)
• A c^k n 5-approximation algorithm for treewidth
• Fundamentals of parameterized complexity
• Hardness results for homology localization
• Minimum bounded chains and minimum homologous chains in embedded simplicial complexes
• On the inherent intractability of certain coding problems (Corresp.)
• Parameterized algorithms
• Paths, Trees, and Flowers
• The least spanning area of a knot and the optimal bounding chain problem
• The parameterized complexity of finding a 2-sphere in a simplicial complex

This page was built for publication: The parameterized complexity of finding minimum bounded chains

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