On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths

For two positive integers k and ℓ , a ( k × ℓ ) - spindle is the union of k pairwise internally vertex-disjoint directed paths with ℓ arcs each between two vertices u and v . We are interested in the (parameterized) complexity of several problems consisting in deciding whether a given digraph contai...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 82; no. 6; pp. 1616 - 1639
Main Authors:	Araújo, Júlio, Campos, Victor A., Maia, Ana Karolinna, Sau, Ignasi, Silva, Ana
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.06.2020 Springer Nature B.V Springer Verlag
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Color coding Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Mathematics Mathematics of Computing Polynomials Spindles Theory of Computation G.2.2 Complexity dichotomy Spindle Representative family FPT algorithm Digraph subdivision Parameterized complexity F.2.2 parameterized complexity complexity dichotomy spindle representative family
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!