The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The minimum spanning strong subdigraph problem is fixed parameter tractable |
scientific article |
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
