15 citations · 26 across the 27 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.CO2012★ 1 cited
Local Clique Covering of Graphs
Ramin Javadi, Zeinab Maleki, Behnaz Omoomi
A k-clique covering of a simple graph G, is an edge covering of G by its cliques such that each vertex is contained in at most k cliques. The smallest k for which G admits a k-cliq…
cs.CV2012★ 3 cited
Clustering Using Isoperimetric Number of Trees
Amir Daneshgar, Ramin Javadi, Basir Shariat Razavi
In this paper we propose a graph-based data clustering algorithm which is based on exact clustering of a minimum spanning tree in terms of a minimum isoperimetry criteria. We show…