Fixed-parameter tractability for the Tree Assembly problem

DOI10.1016/j.tcs.2021.06.036OpenAlexW3173311507MaRDI QIDQ2232586

Jianxin Wang, Jie You, Zhen Zhang, Feng Shi, Jing-Yi Liu

Publication date: 6 October 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.06.036

zbMATH Keywords

fixed-parameter algorithmsubforest isomorphismtree editing distanceTree Assembly problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Parameterized algorithms for minimum tree cut/paste distance and minimum common integer partition
• Kernelization and parameterized algorithms for covering a tree by a set of stars or paths
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees
• Subgraph isomorphism for biconnected outerplanar graphs in cubic time
• Tractabilities for tree assembly problems
• A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
• The greedy algorithm for the minimum common string partition problem
• Covering Tree with Stars
• On the Exact Block Cover Problem
• Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
• Parameterized Algorithms

This page was built for publication: Fixed-parameter tractability for the Tree Assembly problem