2 papers
cs.DS2017
Multi-way sparsest cut problem on trees with a control on the number of parts and outliers
Ramin Javadi, Saleh Ashkboos
Given a graph, the sparsest cut problem asks for a subset of vertices whose edge expansion (the normalized cut given by the subset) is minimized. In this paper, we study a generali…
cs.DC2017
An Efficient Parallel Data Clustering Algorithm Using Isoperimetric Number of Trees
Ramin Javadi, Saleh Ashkboos
We propose a parallel graph-based data clustering algorithm using CUDA GPU, based on exact clustering of the minimum spanning tree in terms of a minimum isoperimetric criteria. We…