Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized algorithms for non-separating trees and branchings in digraphs |
scientific article |
Statements
Parameterized algorithms for non-separating trees and branchings in digraphs (English)
0 references
1 November 2016
0 references
branching
0 references
spanning tree
0 references
fixed-parameter tractable
0 references
parameterized complexity
0 references
linear vertex kernel
0 references
exponential-time algorithm
0 references
partitioning problem
0 references
0 references
0 references
0 references
