Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:20, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems |
scientific article |
Statements
Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (English)
0 references
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
