Finding \(k\)-secluded trees faster

DOI10.1007/978-3-031-15914-5_13arXiv2206.09884MaRDI QIDQ6039423

Bart M. P. Jansen, Jari J. H. de Kroon, Huib Donkers

Publication date: 5 May 2023

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

FPTenumeration algorithmsecluded tree

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A new algorithm for finding trees with many leaves
• Parameterized graph separation problems
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
• Secluded connectivity problems
• The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
• Finding connected secluded subgraphs
• On the computational complexity of length- and neighborhood-constrained path problems
• Parameterized complexity of secluded connectivity problems
• On the Parameterized Complexity of Cutting a Few Vertices from a Graph
• Parameterized Algorithms
• Parameterized algorithms and data reduction for the short secluded s‐t‐path problem

This page was built for publication: Finding \(k\)-secluded trees faster