Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parameterized algorithms for non-separating trees and branchings in digraphs |
scientific article; zbMATH DE number 6646541
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized algorithms for non-separating trees and branchings in digraphs |
scientific article; zbMATH DE number 6646541 |
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
0 references
0.88989925
0 references
0.88968426
0 references
0.8822371
0 references
0.8797729
0 references
0.8793841
0 references
0.8793841
0 references
