3 citations · 3 across the 1 of their papers we have counts for
1 paper · 1 filter
Madhu Illuri, P. Renjith, N. Sadagopan
Given a connected graph G and a terminal set R⊆V(G), {\em Steiner tree} asks for a tree that includes all of R with at most r edges for some integer r≥0. I…