7 citations · 7 across the 5 of their papers we have counts for
1 paper · 1 filter
Jan Van den Bussche
Mining for trees in a graph is shown to be NP-complete.