首页> 外文会议>International frontiers in algorithmics workshop >On Star-Cover and Path-Cover of a Tree
【24h】

On Star-Cover and Path-Cover of a Tree

机译:一棵树的星际和星际

获取原文

摘要

We study two restricted versions of the Subforest Isomorphism problem, the Star-Cover of a Tree (SCT) and the Path-Cover of A Tree (PCT) problems. Both problems are NP-complete. The problems are closely related to a number of well-studied problems, including the problems Subgraph Isomorphism, Tree Editing, and Graph Packing. We show that the problems SCT and PCT are fixed-parameter tractable. Thorough development of parameterized algorithms and kernelization algorithms for these problems are presented.
机译:我们研究了子森林同构问题的两个受限制的版本,即树的星际覆盖(SCT)和树的星际覆盖(PCT)问题。这两个问题都是NP完全的。这些问题与许多经过充分研究的问题密切相关,包括“子图同构”,“树编辑”和“图形打包”问题。我们表明问题SCT和PCT是固定参数可处理的。提出了针对这些问题的参数化算法和核化算法的全面开发。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号