\(k\)-distinct in- and out-branchings in digraphs (Q5111389)
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: k-distinct in- and out-branchings in digraphs |
scientific article; zbMATH DE number 7204510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(k\)-distinct in- and out-branchings in digraphs |
scientific article; zbMATH DE number 7204510 |
Statements
27 May 2020
0 references
digraphs
0 references
branchings
0 references
decompositions
0 references
FPT algorithms
0 references
k-Distinct In- and Out-Branchings in Digraphs (English)
0 references
0.9794453978538512
0 references
0.8210158944129944
0 references
0.7871668338775635
0 references
0.7776322364807129
0 references
