Steiner Type Packing Problems in Digraphs: A Survey
שמור ב:
| הוצא לאור ב: | arXiv.org (Dec 17, 2022), p. n/a |
|---|---|
| מחבר ראשי: | |
| יצא לאור: |
Cornell University Library, arXiv.org
|
| נושאים: | |
| גישה מקוונת: | Citation/Abstract Full text outside of ProQuest |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2681280491 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 2331-8422 | ||
| 035 | |a 2681280491 | ||
| 045 | 0 | |b d20221217 | |
| 100 | 1 | |a Sun, Yuefang | |
| 245 | 1 | |a Steiner Type Packing Problems in Digraphs: A Survey | |
| 260 | |b Cornell University Library, arXiv.org |c Dec 17, 2022 | ||
| 513 | |a Working Paper | ||
| 520 | 3 | |a Graph packing problem is one of the central problems in graph theory and combinatorial optimization. The famous Steiner tree packing problem in undirected graphs has become an well-established area. It is natural to extend this problem to digraphs. In this survey we overview known results on several Steiner type packing problems in digraphs. The paper is divided into six sections: introduction, directed Steiner tree packing problem, directed Steiner path packing problem, strong subgraph packing problem, strong arc decomposition problem, directed Steiner cycle packing problem. This survey also contains some conjectures and open problems for further study. | |
| 653 | |a Apexes | ||
| 653 | |a Graph theory | ||
| 773 | 0 | |t arXiv.org |g (Dec 17, 2022), p. n/a | |
| 786 | 0 | |d ProQuest |t Engineering Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2681280491/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full text outside of ProQuest |u http://arxiv.org/abs/2206.12092 |