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...

Celý popis

Podrobná bibliografia

Vydané v:	Algorithmica Ročník 76; číslo 1; s. 279 - 296
Hlavní autori:	Bang-Jensen, Jørgen, Saurabh, Saket, Simonsen, Sven
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.09.2016
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!