R. Javadi

activity

20082026

most citedOn The Isoperimetric Spectrum of Graphs and Its Approximations

15 citations · 26 across the 27 of their papers we have counts for

collaborators

Showing 2017Show all

4 papers · 1 filter

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…

math.CO2017

On a question of Erdos and Faudree on the size Ramsey numbers

Ramin Javadi, Gholamreza Omidi

For given simple graphs $G_{1}$ and $G_{2}$ , the size Ramsey number $R^(G_{1}, G_{2})$ is the smallest positive integer $m$ , where there exists a graph $G$ with $m$ edges such that in…

math.CO2017

On the size-Ramsey number of cycles

Ramin Javadi, Farideh Khoeini, Gholam Reza Omidi +1

For given graphs $G_{1}, \dots, G_{k}$ , the size-Ramsey number $R^(G_{1}, \dots, G_{k})$ is the smallest integer $m$ for which there exists a graph $H$ on $m$ edges such that in every $…