Sciweavers

92
Voted
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
15 years 3 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev