Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems (Q2839214)
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: Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems |
scientific article; zbMATH DE number 6184192
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems |
scientific article; zbMATH DE number 6184192 |
Statements
4 July 2013
0 references
out-trees
0 references
out-branchings
0 references
leaves
0 references
internal vertices
0 references
FPT
0 references
kernel
0 references
0 references
0.91062593
0 references
0.8997461
0 references
0.8997461
0 references
0.89733887
0 references
0.89416146
0 references
0.87339646
0 references
0.87033445
0 references
0.8703344
0 references
0.86769366
0 references
Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems (English)
0 references
