3 citations · 3 across the 1 of their papers we have counts for
1 paper · 1 filter
Alexander Göke, Jochen Koenemann, Matthias Mnich +1
A classical branch of graph algorithms is graph transversals, where one seeks a minimum-weight subset of nodes in a node-weighted graph G which intersects all copies of subgraphs…