8 research outputs found
Packing Strong Subgraph in Digraphs
Get PDFIn 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
Steiner type problems for digraphs that are locally semicomplete or extended semicomplete
No full text35th Symposium on Theoretical Aspects of Computer Science: STACS 2018, February 28-March 3, 2018, Caen, France
Get PDF38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2018, December 11-13, 2018, Ahmedabad, India
Get PDFProceedings of the 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications
Get PDF
