Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Javadi, Ramin"'
This paper introduces the Stable Matching Based Pairing (SMBP) algorithm, a high-performance external validity index for clustering evaluation in large-scale datasets with a large number of clusters. SMBP leverages the stable matching framework to pa
Externí odkaz:
http://arxiv.org/abs/2409.14455
Autor:
Javadi, Ramin, Miralaei, Meysam
Wu in 1999 conjectured that if $H$ is a subgraph of the complete graph $K_{2n+1}$ with $n$ edges, then there is a Hamiltonian cycle decomposition of $K_{2n+1}$ such that each edge of $H$ is in a separate Hamiltonian cycle. The conjecture was partiall
Externí odkaz:
http://arxiv.org/abs/2403.17290
Autor:
Javadi, Ramin, Nikabadi, Amir
Publikováno v:
In Discrete Applied Mathematics 15 October 2024 355:1-12
Autor:
Javadi, Ramin, Momeni, Ali
In this paper, we study the game of cops and robber on the class of graphs with no even hole (induced cycle of even length) and claw (a star with three leaves). The cop number of a graph $G$ is defined as the minimum number of cops needed to capture
Externí odkaz:
http://arxiv.org/abs/2112.07503
Given graphs $ F_1, F_2$ and $G$, we say that $G$ is Ramsey for $(F_1,F_2)$ and we write $G\rightarrow(F_1, F_2)$, if for every edge coloring of $G$ by red and blue, there is either a red copy of $F_1$ or a blue copy of $F_2$ in $G$. The size Ramsey
Externí odkaz:
http://arxiv.org/abs/2111.02065
Autor:
Hajebi, Sahab, Javadi, Ramin
A matching is a set of edges in a graph with no common endpoint. A matching M is called acyclic if the induced subgraph on the endpoints of the edges in M is acyclic. Given a graph G and an integer k, Acyclic Matching Problem seeks for an acyclic mat
Externí odkaz:
http://arxiv.org/abs/2109.06004
Autor:
Javadi, Ramin, Miralaei, Meysam
Given a positive integer $ r $, the $ r $-color size-Ramsey number of a graph $ H $, denoted by $ \hat{R}(H, r) $, is the smallest integer $ m $ for which there exists a graph $ G $ with $ m $ edges such that, in any edge coloring of $ G $ with $ r $
Externí odkaz:
http://arxiv.org/abs/2106.16023
Autor:
Javadi, Ramin, Nikabadi, Amir
We present a parameterized dichotomy for the \textsc{$k$-Sparsest Cut} problem in weighted and unweighted versions. In particular, we show that the weighted \textsc{$k$-Sparsest Cut} problem is NP-hard for every $k\geq 3$ even on graphs with bounded
Externí odkaz:
http://arxiv.org/abs/1910.12353
For positive integers $n\geq k\geq t$, a collection $ \mathcal{B} $ of $k$-subsets of an $n$-set $ X $ is called a $t$-packing if every $t$-subset of $ X $ appears in at most one set in $\mathcal{B}$. In this paper, we give some upper and lower bound
Externí odkaz:
http://arxiv.org/abs/1905.10807