Arc-disjoint spanning sub(di)graphs in digraphs

We prove that a number of natural problems concerning the existence of arc-disjoint directed and “undirected” (spanning) subdigraphs in a digraph are NP-complete. Among these are the following of which the first settles an open problem due to Thomassé (see e.g. Bang-Jensen and Gutin (2009) [1, Probl...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science 2012-06, Vol.438, p.48-54
Hauptverfasser:	Bang-Jensen, Jørgen, Yeo, Anders
Format:	Artikel
Sprache:	eng
Schlagworte:	Arc-disjoint subdigraphs Branchings Graph theory NP-completeness Paths and cycles Spanning trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!