Sciweavers

DAM
2008
140views more  DAM 2008»
14 years 3 hour ago
The minimum spanning strong subdigraph problem is fixed parameter tractable
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
Jørgen Bang-Jensen, Anders Yeo