On Reachability Mixed Arborescence Packing

08/22/2018
by   Tatsuya Matsuoka, et al.
0

As a generalization of the Edmonds arborescence packing theorem, Kamiyama--Katoh--Takizawa (2009) gave a good characterization of directed graphs that contain arc-disjoint arborescences spanning the set of vertices reachable from each root. Fortier--Király--Léonard--Szigeti--Talon (2018) asked whether the result can be extended to mixed graphs by allowing both directed arcs and undirected edges. In this paper, we solve this question by developing a polynomial-time algorithm for finding a collection of edge and arc-disjoint arborescences spanning the set of vertices reachable from each root in a given mixed graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/27/2020

Packing of mixed hyperarborescences with flexible roots via matroid intersection

Given a mixed hypergraph ℱ=(V,𝒜∪ℰ), functions f,g:V→ℤ_+ and an integer k...
research
05/04/2021

FPT algorithms for packing k-safe spanning rooted sub(di)graphs

We study three problems introduced by Bang-Jensen and Yeo [Theor. Comput...
research
02/28/2020

Edge-Disjoint Branchings in Temporal Graphs

A temporal digraph G is a triple (G, γ, λ) where G is a digraph, γ is a ...
research
06/23/2022

On the complexity of packing rainbow spanning trees

One of the most important questions in matroid optimization is to find d...
research
05/29/2023

Bandwidth Optimal Pipeline Schedule for Collective Communication

We present a strongly polynomial-time algorithm to generate bandwidth op...
research
03/28/2019

Arc-disjoint Strong Spanning Subdigraphs of Semicomplete Compositions

A strong arc decomposition of a digraph D=(V,A) is a decomposition of it...
research
03/08/2019

Complexity of packing common bases in matroids

One of the most intriguing unsolved questions of matroid optimization is...

Please sign up or login with your details

Forgot password? Click here to reset