Scholarlink

In the two former sections, we introduce the complexity for IDSPP on Eulerian digraphs and symmetric digraphs, and the complexity for ADSPP on general digraphs, when both k and \(\ell \) are fixed. In the third section, we introduce a related topic: directed path connectivity.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Directed Steiner Path Packing Problem

  • 章节

  • 发表日期：

    2026年

查看全文
  • Yuefang Sun

摘要

In the two former sections, we introduce the complexity for IDSPP on Eulerian digraphs and symmetric digraphs, and the complexity for ADSPP on general digraphs, when both k and \(\ell \) are fixed. In the third section, we introduce a related topic: directed path connectivity.