Packing Strong Subgraph in Digraphs
Guardado en:
| 發表在: | arXiv.org (Oct 25, 2021), p. n/a |
|---|---|
| 主要作者: | |
| 其他作者: | , |
| 出版: |
Cornell University Library, arXiv.org
|
| 主題: | |
| 在線閱讀: | Citation/Abstract Full text outside of ProQuest |
| 標簽: |
沒有標簽, 成為第一個標記此記錄!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2586237598 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2586237598 | ||
| 045 | 0 | |b d20211025 | |
| 100 | 1 | |a Sun, Yuefang | |
| 245 | 1 | |a Packing Strong Subgraph in Digraphs | |
| 260 | |b Cornell University Library, arXiv.org |c Oct 25, 2021 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a In this paper, we study two types of strong subgraph packing problems in digraphs, including internally disjoint strong subgraph packing problem and arc-disjoint strong subgraph packing problem. These problems can be viewed as generalizations of the famous Steiner tree packing problem and are closely related to the strong arc decomposition problem. We first prove the NP-completeness for the internally disjoint strong subgraph packing problem restricted to symmetric digraphs and Eulerian digraphs. Then we get inapproximability results for the arc-disjoint strong subgraph packing problem and the internally disjoint strong subgraph packing problem. Finally we study the arc-disjoint strong subgraph packing problem restricted to digraph compositions and obtain some algorithmic results by utilizing the structural properties. | |
| 653 | |a Packing problem | ||
| 653 | |a Graphs | ||
| 653 | |a Graph theory | ||
| 700 | 1 | |a Gutin, Gregory | |
| 700 | 1 | |a Zhang, Xiaoyan | |
| 773 | 0 | |t arXiv.org |g (Oct 25, 2021), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2586237598/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/2110.12783 |