The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234)
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: The minimum spanning strong subdigraph problem is fixed parameter tractable |
scientific article; zbMATH DE number 5526342
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimum spanning strong subdigraph problem is fixed parameter tractable |
scientific article; zbMATH DE number 5526342 |
Statements
The minimum spanning strong subdigraph problem is fixed parameter tractable (English)
0 references
9 March 2009
0 references
minimum strong spanning subdigraph
0 references
polynomial algorithm
0 references
FTP algorithm
0 references
0 references
0 references
0.90188473
0 references
0.8734492
0 references
0 references
0.87211674
0 references
0.8692076
0 references
0.86892235
0 references
0.8637139
0 references
0.8635754
0 references
