The following pages link to Jinsong Tan (Q975482):
Displaying 12 items.
- A note on the inapproximability of correlation clustering (Q975483) (← links)
- On Cheeger inequalities of a graph (Q1402090) (← links)
- Ordering trees by the spectral radius of Laplacian (Q1977019) (← links)
- Algorithmic and complexity issues of three clustering methods in microarray data analysis (Q2384782) (← links)
- The consecutive ones submatrix problem for sparse matrices (Q2642313) (← links)
- LAPLACIAN SPECTRA AND CHROMATIC NUBERS OF GRAPHS (Q2769880) (← links)
- The Networked Common Goods Game (Q3066468) (← links)
- Inapproximability of Maximum Weighted Edge Biclique and Its Applications (Q3502654) (← links)
- On Isospectral Graphs. (Q4241105) (← links)
- Eigenvalue Comparison Theorems of Neumann Laplacian for Graphs. (Q4943490) (← links)
- Algorithms and Computation (Q5712170) (← links)
- Computing and Combinatorics (Q5716925) (← links)
