On the parameterized complexity of the connected flow and many visits TSP problem

DOI10.1007/978-3-030-86838-3_5OpenAlexW3202584507MaRDI QIDQ2672424

Isja Mannens, Jesper Nederlof, Krisztina Szilágyi, Céline M. F. Swennenhuis

Publication date: 8 June 2022

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Polynomial kernels for weighted problems
• The directed subgraph homeomorphism problem
• Many-visits TSP revisited
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
• Finding Two Edge-Disjoint Paths with Length Constraints
• The Traveling Salesman Problem with Many Visits to Few Cities
• Fast Hamiltonicity Checking Via Bases of Perfect Matchings
• Time- and Space-optimal Algorithm for the Many-visits TSP
• On Computing the Hamiltonian Index of Graphs
• Parameterized Algorithms

This page was built for publication: On the parameterized complexity of the connected flow and many visits TSP problem