Parameterized Algorithms for Non-separating Trees and Branchings in Digraphs

A well known result in graph algorithms, due to Edmonds, states that given a digraph D and a positive integer ℓ , we can test whether D contains ℓ arc-disjoint out-branchings in polynomial time. However, if we ask whether there exists an out-branching and an in-branching which are arc-disjoint, then...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica Jg. 76; H. 1; S. 279 - 296
Hauptverfasser:	Bang-Jensen, Jørgen, Saurabh, Saket, Simonsen, Sven
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.09.2016
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation Branching Linear vertex kernel Partitioning problem Spanning tree Fixed parameter tractable Parameterized complexity Exponential time algorithm
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!