☆ 4.3 Article

Packing of spanning mixed arborescences

JOURNAL OF GRAPH THEORY (2021)

Packing of maximal independent mixed arborescences

Hui Gao et al.

Summary: This study focuses on solving a packing problem by finding trees with specific properties in a mixed graph, presenting a new solution along with a corresponding algorithm and exploring new avenues for arborescence packings using the technique of using components.

DISCRETE APPLIED MATHEMATICS (2021)

添加到收藏夹

Article Mathematics

Packing branchings under cardinality constraints on their root sets

Hui Gao et al.

Summary: This paper study the problem of packing branchings in digraphs under cardinality constraints on their root sets by arborescence augmentation. The paper provides a characterization of when k arc-disjoint spanning arborescences can be completed with certain prescribed root sets in a digraph.

EUROPEAN JOURNAL OF COMBINATORICS (2021)

添加到收藏夹

Article Operations Research & Management Science