The parameterized space complexity of embedding along a path

DOI10.1007/s00224-016-9728-7zbMath1378.68068arXiv1602.09022OpenAlexW2962855797MaRDI QIDQ2408562

Moritz Müller, Hubie Chen

Publication date: 12 October 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.09022

zbMATH Keywords

embeddinghomomorphismparameterized space complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Advice classes of parametrized tractability
• Describing parameterized complexity classes
• On the space and circuit complexity of parameterized problems: classes and completeness
• Parametrized complexity theory.
• The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space
• Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem
• Undirected connectivity in log-space
• Color-coding
• The Parameterized Complexity of k-B<scp>iclique</scp>

This page was built for publication: The parameterized space complexity of embedding along a path