مرور Volume 51, Issue 2 بر اساس عنوان

در حال نمایش موارد 1 - 12 از 12

  • Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions 

    Imanparast, Mahdi؛ Hashemi, Seyed Naser؛ Mohades, Ali (University of Tehran, 2019-12-01)
    We study the problem of computing the diameter of a  set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ ...

  • Eye Tracking for Autism Disorder Analysis using Image Processing 

    Kiapasha, Zohre؛ Mahdavi, Iraj؛ Fazlollahtabar, Hamed؛ Kiapasha, Zahra (University of Tehran, 2019-12-01)
    Analyzing eyes performance is essential for effective functioning of human. Therefore, following their motion could help doctors to make quick and accurate diagnoses for disorders like Autism, schizophrenia, or attention ...

  • Fr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories 

    Saeidi, Zeinab؛ Farshi, Mohammad (University of Tehran, 2019-12-01)
    vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ ...

  • A generalization of zero-divisor graphs 

    Nasehpour, Peyman (University of Tehran, 2019-12-01)
    In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores

  • Maximum Zagreb Indices Among All $p-$Quasi $k-$Cyclic Graphs 

    Ashrafi, Ali Reza؛ Ghalavand, Ali (University of Tehran, 2019-12-01)
    vspace{0.2cm}Suppose $G$ is a simple and connected graph. The first and second Zagreb indices of $G$ are two degree-based graph invariants defined as $M_1(G) = sum_{v in V(G)}deg(v)^2$ and $M_2(G) = sum_{e=uv in ...

  • Minimum Spanning Tree of Imprecise Points Under $L_1$-metric 

    Mesrikhani, Amir؛ Farshi, Mohammad؛ Iranfar, Behnam (University of Tehran, 2019-12-01)
    Let $S$ be a set of imprecise points that is represented by axis-aligned pairwise disjoint squares in the plane. A precise instance of $S$ is a set of points, one from each region of $S$. In this paper, we study the optimal ...

  • On the max - ``Fuzzy Or'' composition fuzzy inequalities systems 

    Ghodousian, Amin؛ Babalhavaeji, Ali؛ Bashir, Elnaz (University of Tehran, 2019-12-01)

  • On the outer-connected reinforcement and bondage problems in bipartite graphs: the algorithmic complexity 

    Hashemipour, Maliheh؛ Hooshmandasl, Mohammadreza؛ Shakiba, Ali (University of Tehran, 2019-12-01)
    An outer connected dominating(OCD) set of a graph $G=(V,E)$ is a set $tilde{D} subseteq V$ such that every vertex not in $S$ is adjacent to a vertex in $S$, and the induced subgraph of $G$ by $V setminus tilde{D}$, i.e. ...

  • PD-prime cordial labeling of graphs 

    Ponraj, R؛ SUBBULAKSHMI, S؛ Somasundaram, S (University of Tehran, 2019-12-01)
    vspace{0.2cm} Let $G$ be a graph and $f:V(G)rightarrow {1,2,3,.....left|V(G)right|}$ be a bijection. Let $p_{uv}=f(u)f(v)$ and $ d_{uv}= begin{cases} left[frac{f(u)}{f(v)}right] ~~if~~ f(u) geq ...

  • A Review of Replica Replacement Techniques in Grid Computing and Cloud Computing 

    Mansouri, Najme؛ Javidi, Mohammad (University of Tehran, 2019-12-01)
    A data-intensive computing platform, encountered in some grid and cloud computing applications, includes numerous tasks that process, transfer or analysis large data files. In such environments, there are large and ...

  • Tenacious Graph is NP-hard 

    Moazzami, Dara (University of Tehran, 2019-12-01)
    The tenacity of a graph $G$, $T(G)$, is defined by$T(G) = min{frac{mid Smid +tau(G-S)}{omega(G-S)}}$, where theminimum is taken over all vertex cutsets $S$ of $G$. We define$tau(G - S)$ to be the number ...

  • Xerus Optimization Algorithm (XOA): a novel nature-inspired metaheuristic algorithm for solving global optimization problems 

    Samie Yousefi, Farnood؛ Karimian, Noushin؛ Ghodousian, Amin (University of Tehran, 2019-12-01)
    Over the recent years, many research has been carried out on applying the optimization approach to science and engineering problems. Thereby, numerous metaheuristic algorithms have been developed for solving such type of ...