activity
20162023
most citedA Note on Computational Complexity of Kill-all Go

2 citations · 4 across the 7 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.CC2016

Complexity Analysis of 2-Heterogeneous Minimum Spanning Forest Problem

Zhujun Zhang, Qiang Sun

For complexity of the heterogeneous minimum spanning forest problem has not been determined, we reduce 3-SAT which is NP-complete to 2-heterogeneous minimum spanning forest problem…