Han Q.

Q. Han

Information about the author Q. Han will soon be added to the site.
Found 1 papers in total
An improved rounding method and semidefinite programming relaxation for graph partition
2002
Given an undirected graph G = (V, E) with |V| = n and an integer k...
Papers per page: