首页> 美国政府科技报告 >The Directed Subgraph Homeomorphism Problem.
【24h】

The Directed Subgraph Homeomorphism Problem.

机译:有向子图同胚问题。

获取原文

摘要

The set of pattern graphs, for which the fixed directed subgraph homeomorphism problem is NP-complete is characterized. A polynomial time algorithm is given for the remaining cases. The restricted problem where the input graph is a directed acyclic graph is in polynomial time for all pattern graphs, and an algorithm is given. (Author)

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号