On packing spanning arborescences with matroid constraint
type: Item
instance of: scholarly article
title: On packing spanning arborescences with matroid constraint
zbMATH Open document ID: 1378.05021
author: Quentin Fortier
author: Csaba Király
author: Zoltán Szigeti
author: Shin-Ichi Tanigawa
publication date: 2018-01-18T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/26563
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 52B40
zbMATH DE Number: 6827210
zbMATH Keywords: connectivity
zbMATH Keywords: packing arborescences
zbMATH Keywords: Edmonds' branching theorem
zbMATH Keywords: matroid
MaRDI profile type: Publication
OpenAlex ID: W2744768237
cites work: Covering intersecting bi-set families under matroid constraints
cites work: Matroid-Based Packing of Arborescences
cites work: Arc-disjoint in-trees in directed graphs
cites work: Q5390304
DOI: 10.1016/J.ENDM.2017.06.073
Recommended article: On packing spanning arborescences with matroid constraint
Recommended article: Packing of arborescences with matroid constraints via matroid intersection
Recommended article: Matroid-Based Packing of Arborescences
Recommended article: A note on packing spanning trees in graphs and bases in matroids
Recommended article: Packing algorithms for arborescences (and spanning trees) in capacitated graphs
Recommended article: Two packing problems on \(k\)-matroid trees
Recommended article: A matroid approach to finding edge connectivity and packing arborescences
Recommended article: Packing of rigid spanning subgraphs and spanning trees
Recommended article: Q5288885
description: scientific article; zbMATH DE number 6827210