4 citations · 10 across the 12 of their papers we have counts for
1 paper · 2 filters
Shiva Kintali, Nishad Kothari, Akash Kumar
Several problems that are NP-hard on general graphs are efficiently solvable on graphs with bounded treewidth. Efforts have been made to generalize treewidth and the related notion…