Sciweavers

ESA
2006
Springer
111views Algorithms» more  ESA 2006»
13 years 8 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev