On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Isja Mannens, Jesper Nederlof, Céline Swennenhuis, Krisztina Szilágyi

Journal title: Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers

Journal number: 12911

Journal publisher: Springer International Publishing

Published year: 2021

Published pages: 52-79

DOI identifier: 10.1007/978-3-030-86838-3_5

ISBN: 978-3-030-86837-6