Tu Jianhua

Jianhua Tu

Information about the author Jianhua Tu will soon be added to the site.
Found 3 papers in total
On the vertex cover P3 problem parameterized by treewidth
2017
Consider a graph G . A subset of vertices, F , is called a vertex cover P t ( V C P t...
The generalized 3-connectivity of star graphs and bubble-sort graphs
2016
For S ⊆ G , let K ( S ) denote the maximum number r of edge‐disjoint trees...
A factor 2 approximation algorithm for the vertex cover P3 problem
2011
• In the article we translate the camera layout problem into the vertex cover P n...
Papers per page: