Matroid-reachability-based decomposition into arborescences

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics Pub Date : 2025-08-29 DOI:10.1016/j.dam.2025.08.036

Florian Hörsch , Benjamin Peyrille , Zoltán Szigeti

引用次数: 0

Abstract

The problem of complete matroid-reachability-based packing of arborescences was solved by Király. Here we solve the corresponding decomposition problem that turns out to be more complicated. The result is obtained from the solution of the more general problem of matroid-reachability-based

(ℓ, ℓ^{'})

-limited packing of arborescences where we are given a lower bound

ℓ

and an upper bound

ℓ^{'}

on the total number of arborescences in the packing. The problem is considered for branchings as well.

查看原文本刊更多论文

基于拟矩阵可达性的乔木分解

利用Király求解了基于完全拟阵可达性的乔木排列问题。在这里，我们解决了相应的分解问题，这个问题变得更加复杂。这一结果是由更一般的基于矩阵可达性的（r, r '）有限树形排列问题的解得到的，该问题给出了树形排列中树形排列总数的下界和上界。分支机构也考虑了这个问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Applied Mathematics 数学-应用数学

CiteScore

2.30

自引率

9.10%

发文量

422

审稿时长

4.5 months

期刊介绍： The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.