1 code implementation • 1 Jan 2023 • Ali Shakiba
In this paper, we reduce the complexity of approximating the correlation clustering problem from $O(m\times\left( 2+ \alpha (G) \right)+n)$ to $O(m+n)$ for any given value of $\varepsilon$ for a complete signed graph with $n$ vertices and $m$ positive edges where $\alpha(G)$ is the arboricity of the graph.
no code implementations • 13 Nov 2022 • Ali Shakiba
Our results show that the dynamic operations have local effects on the neighboring vertices and we employ this locality to reduce the dependency of the running time in the Baseline to the summation of the degree of all vertices in $G_t$, the graph after applying the graph edit operation at time step $t$, to the summation of the degree of the changing vertices (e. g. two endpoints of an edge) and the number of clusters in the previous time step.
no code implementations • 27 May 2018 • Ali Shakiba, Amir Kafshdar Goharshady, MohammadReza Hooshmandasl, Mohsen Alambardar Meybodi
We study relations between evidence theory and S-approximation spaces.