3 citations · 5 across the 8 of their papers we have counts for
1 paper · 1 filter
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate +3
We introduce and investigate the approximability of the maximum binary tree problem (MBT) in directed and undirected graphs. The goal in MBT is to find a maximum-sized binary tree…