Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Volume 52 (2020)
Volume 51 (2019)
Volume 50 (2018)
Volume 49 (2017)
Volume 48 (2016)
Volume 47 (2016)
Volume 46 (2015)
Volume 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
A generalization of zero-divisor graphs

Peyman Nasehpour

Volume 51, Issue 2 , December 2019, , Pages 35-45

https://doi.org/10.22059/jac.2019.75141

Abstract
  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  Read More

Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions

Mahdi Imanparast; Seyed Naser Hashemi; Ali Mohades

Volume 51, Issue 2 , December 2019, , Pages 47-61

https://doi.org/10.22059/jac.2019.75162

Abstract
  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})$ time and $O(n)$ space, where $0 < \varepsilon\leqslant 1$. We also ...  Read More