论文标题
Digraphs中的Steiner型包装问题：调查
Steiner Type Packing Problems in Digraphs: A Survey
论文作者
论文摘要
图形填料问题是图理论和组合优化的中心问题之一。著名的施泰纳树木包装问题在无向图中已成为一个完善的区域。将这个问题扩展到挖掘是很自然的。 在这项调查中，我们概述了有关Digraphs中几个Steiner型包装问题的已知结果。该论文分为六个部分：介绍，定向施泰纳树包装问题，定向的施泰纳路径包装问题，强大的子图包装问题，强弧分解问题，定向施泰纳循环包装问题。这项调查还包含一些猜想和开放问题，以供进一步研究。
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.
