Volume 55 (2023)
Issue 1 June 2023, Pages 1-189
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)

There is no charge for publishing a paper at the Journal of Algorithms and Computation

$4$-total mean cordial labeling of spider graph

R Ponraj; S SUBBULAKSHMI; Prof.Dr M.Sivakumar

Volume 55, Issue 1 , June 2023, Pages 1-9

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

Abstract
  Let $G$ be a graph. Let $f:V\left(G\right)\rightarrow \left\{0,1,2,\ldots,k-1\right\}$ be a function where $k\in \mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $f\left(uv\right)=\left\lceil \frac{f\left(u\right)+f\left(v\right)}{2}\right\rceil$. $f$ is called a $k$-total mean cordial ...  Read More

Perfectionism Search Algorithm (PSA): An Efficient Meta-Heuristic Optimization Approach

Amin Ghodousian; Mahdi Mollakazemiha; Noushin Karimian

Volume 55, Issue 1 , June 2023, Pages 11-36

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

Abstract
  This paper proposes a novel population-based meta-heuristic optimization algorithm, called Perfectionism SearchAlgorithm (PSA), which is based on the psychological aspects of perfectionism. The PSA algorithm takes inspiration from one of the most popular model of perfectionism, which was proposed by ...  Read More

A new meta-heuristic algorithm of giant trevally for solving engineering problems

Marjan Aliyari

Volume 55, Issue 1 , June 2023, Pages 37-51

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

Abstract
  As science and technology is progressing in engineering problems are also getting much more complex. So, solving these problems is of pivotal concern. Besides, the optimal solution among the solutions is of great value. Among them, innovative algorithms inspired by artificial intelligence or the hunting ...  Read More

On some main parameters of stochastic processes on directed graphs

Mehdi Shams; Gholamreza Hesamian

Volume 55, Issue 1 , June 2023, Pages 53-65

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

Abstract
  A random walk is a special kind of stochastic process of the Markov chain type. Some stochastic processes can be represented as a random walk on a graph. In this paper, the main parameters for a random walk on graph are examined.  Read More

Pair Difference Cordial Labeling of Double Alternate Snake Graphs

R Ponraj; A Gayathri

Volume 55, Issue 1 , June 2023, Pages 67-77

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

Abstract
  In this paper we investigate the pair difference cordial labeling behavior of double alternate triangular snake and double alternate quadrilatral snake graphs.  Read More

An attributed network embedding method to predict missing links in protein-protein interaction networks

Ali Golzadeh; Ali Kamandi; Hossein Rahami

Volume 55, Issue 1 , June 2023, Pages 79-99

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

Abstract
  Predicting missing links in noisy protein-protein interaction networks is an essential~computational method. Recently, attributed network embedding methods have been shown to be significantly effective in generating low-dimensional representations of nodes to predict links; in these representations, ...  Read More

Hybrid Filter-Wrapper Feature Selection using Equilibrium Optimization

Mohammad Ansari Shiri; Najme Mansouri

Volume 55, Issue 1 , June 2023, Pages 101-122

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

Abstract
  The topic of feature selection has become one of the hottest subjects in machine learning over the last few years. The results of evolutionary algorithm selection have also been promising, along with standard feature selection algorithms. For K-Nearest Neighbor (KNN) classification, this paper presents ...  Read More

A Note on Change Point Analysis Using Filtering

Reza Habibi

Volume 55, Issue 1 , June 2023, Pages 123-129

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

Abstract
  The Kalman-Bucy filter is studied under different scenarios for observation and state equations, however, an important question is, how this filter may be applied to detect the change points. In this paper, using the Bayesian approach, a modified version of this filter is studied which has good and justifiable ...  Read More

Sequence pairs related to produced graphs from a method for dividing a natural number by two.

Mohammad Zeynali Azim; Saeid Alikhani; Babak Anari; Bagher Zarei

Volume 55, Issue 1 , June 2023, Pages 131-140

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

Abstract
  This paper is about producing a new kind of pairs which we call MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present some applications of these pairs that show their interesting properties ...  Read More

Using a New Strategy in Imperialist Competitive Algorithm to Solve Multi‑objective Problems (WSICA)

Mina Moosapour; Ahmad Bagheri; Mohammad Javad Mahmoodabadi

Volume 55, Issue 1 , June 2023, Pages 141-183

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

Abstract
  The imperialist competitive algorithm (ICA) is developed based on the socio-political process of imperialist competitions. It is an efficient approach for single-objective optimization problems. However, this algorithm fails to optimize multi-objective problems (MPOs) with conflicting objectives. This ...  Read More

A variant of van Hoeij's algorithm to compute hypergeometric term solutions of holonomic recurrence equations
Articles in Press, Accepted Manuscript, Available Online from 13 January 2022

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

Abstract
  Linear and homogeneous recurrence equations having polynomial coefficients are said to be holonomic. These equations are useful for proving and discovering combinatorial and hypergeometric identities. Given a field $\mathbb{K}$ of characteristic zero, $a_n$ is a hypergeometric term with respect to $\mathbb{K}$, ...  Read More

Overlapping Clusters in Cluster Convolutional Networks
Articles in Press, Accepted Manuscript, Available Online from 13 January 2022

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

Abstract
   A popular research topic in Graph Convolutional Networks (GCNs) is to speedup the training time of the network.  The main bottleneck in training GCN is the exponentially growing of computations. In Cluster-GCN based on this fact that each node and its neighbors are usually grouped ...  Read More

Pair difference cordial labeling of planar grid and mongolian tent
Articles in Press, Accepted Manuscript, Available Online from 13 January 2022

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

Abstract
  \noindent Let $G = (V, E)$ be a $(p,q)$ graph.\\Define \begin{equation*}\rho =\begin{cases}\frac{p}{2} ,& \text{if $p$ is even}\\\frac{p-1}{2} ,& \text{if $p$ is odd}\\\end{cases}\end{equation*}\\  and $L = \{\pm1 ,\pm2, \pm3 , \cdots ,\pm\rho\}$ called the set of labels.\\\noindent ...  Read More

A comparison between the resolution and linear optimization of FREs defined by product t-norm and geometric mean operator
Articles in Press, Accepted Manuscript, Available Online from 14 January 2022

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

Abstract
  In this paper, a type of fuzzy system is firstly investigated whereby the feasible region is defined by the fuzzy relational equalities and the geometric mean as fuzzy composition. Some related basic and theoretical properties are derived and the feasible region is completely determined. Moreover, a ...  Read More

On the J-Tightness of Graphs
Articles in Press, Accepted Manuscript, Available Online from 14 January 2022

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

Abstract
  We introduce a new invariant vulnerability parameter named “J-Tightness” or “J(G)” for graphs. As a stability measure, its properties along with comparisons to other parameters of a graph are proposed. We show how it is calculated for complete graphs and cycles. We show that J-Tightness ...  Read More

A fast algorithm for the linear programming problem constrained with the Weighted power mean -- Fuzzy Relational Equalities (WPM-FRE)
Articles in Press, Accepted Manuscript, Available Online from 14 January 2022

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

Abstract
  In this paper, a linear programming problem is investigated in which the feasible region is formed as a special type of fuzzy relational equalities (FRE). In this type of FRE, fuzzy composition is considered as the weighted power mean operator (WPM). Some theoretical properties of the feasible region ...  Read More

Fuzzy Cumulative Distribution Function \and its Properties
Articles in Press, Accepted Manuscript, Available Online from 14 January 2022

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

Abstract
  The statistical methods based on cumulative distribution function is a start point for  many parametric or nonparametric statistical inferences. However, there are many practical problems that require dealing with observations/parameters that represent inherently imprecise.  However, Hesamian ...  Read More

An algorithm to Solve the Linear Programming Problem Constrained with the Harmonic–Fuzzy Relational Equalities
Articles in Press, Accepted Manuscript, Available Online from 15 January 2022

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

Abstract
  In this paper, a linear programming problem is investigated in which the feasible region is formed as the intersection of fuzzy relational equalities and the harmonic mean operator is considered as fuzzy composition. Theoretical properties of the feasible region are derived. It is proved that the feasible ...  Read More

Plane Bounded-Degree Spanners Among the Obstacles for the Points in Convex Position
Articles in Press, Accepted Manuscript, Available Online from 15 January 2022

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

Abstract
  Let $S$ be a set of points in the plane that are in convex position. Let~$\cal O$ be a set of simple polygonal obstacles whose vertices are in $S$. The visibility graph $Vis(S,{\cal O})$  is the graph which is obtained from the complete graph of $S$ by removing all edges intersecting some obstacle ...  Read More

Effective Tamper Detection and Recovery of Images after Serious Attacks
Articles in Press, Accepted Manuscript, Available Online from 15 January 2022

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

Abstract
  Confirming the integrity of transmitted sensitive digital content is a significant issue due to the evolution in communication technologies and the accessibility of image processing tools. Watermarking has been a successful method of authentication and integrity verification recently. However, several ...  Read More

On the resolution of LP-FRE defined by the convex combination operator
Articles in Press, Accepted Manuscript, Available Online from 15 January 2022

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

Abstract
  In this paper, a linear programming problem is investigated in which the feasible region is formed as a special type of fuzzy relational equalities (FRE). In this type of FRE, fuzzy composition is considered as the convex combination operator. It is proved that the feasible region of the problem can ...  Read More

Priority-Oriented Task Scheduling based on Harris Hawks Optimizer for Cloud Computing
Articles in Press, Accepted Manuscript, Available Online from 15 January 2022

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

Abstract
   Cloud computing is a high-performance computing environment that can remotely provide services to customers using a pay-per-use model. The principal challenge in cloud computing is task scheduling, in which tasks must be effectively allocated to resources. The mapping of cloud resources to customer ...  Read More

A Systematic Way for Selecting Suitable Journal for Publishing Manuscripts
Articles in Press, Accepted Manuscript, Available Online from 16 January 2022

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

Abstract
  \noindent Selecting suitable journals for publishing manuscripts for publication is one of the most essential processes before publishing any manuscript. Finding the relevant journal is a key factor which proves one's work valuable to the entire society. The final output and the performance of one's ...  Read More

$P_3$-Rainbow Edge Colouring of Digraphs
Articles in Press, Accepted Manuscript, Available Online from 16 January 2022

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

Abstract
  An edge  coloring of a digraph  $D$ is called a $P_3$-rainbow edge coloring if  the edges of any directed path of $D$ with length 2 are colored with different colors. It is proved that  for a $P_3$-rainbow edge coloring of  a digraph $D$, at least $\left\lceil{log_2{\chi(D)}} ...  Read More

Negative Cost Girth Problem using Map-Reduce Framework
Articles in Press, Accepted Manuscript, Available Online from 16 January 2022

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

Abstract
  On a graph with a negative cost cycle, the shortest path is undefined, but the number of edges of the shortest negative cost cycle could be computed. It is called Negative Cost Girth (NCG). The NCG problem is applied in many optimization issues such as scheduling and model verification. The existing ...  Read More

An iterative method and maximal solution of Coupled algebraic Riccati equations

Hajar Alimorad

Articles in Press, Accepted Manuscript, Available Online from 29 August 2022

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

Abstract
  Coupled Riccati equation has widely been applied to various engineering areas such as jump linear quadratic problem, particle transport theory, and Wiener–Hopf decomposition of Markov chains. In this paper, we consider an iterative method for computing Hermitian solution of the Coupled Algebraic ...  Read More

ISO Abbreviation: 

J. Algorithm Comput. 

Frequency: Semiannual

Peer Review Policy: Double Blind

Language: English

Acceptance Rate: 10%

Average Time to First Decision: 30 days

Average Time to Final Decision: 6 months

Publishing Policy: Open Access

   

     

Publisher:
University of Tehran

Editorial Board:
Dara Moazzami


Frequency: Monthly

Print ISSN: 2476-2776

Online ISSN: 2476-2784

Indexing and Abstracting

Linkedin

Academia

Magiran

penprofile

...

PlagScan

Any submitted manuscript with plagiarism level greater than 25% will be automatically rejected.

CEIJ and and the Committee on Publication Ethics

This journal subscribes to the principles of, the Committee on Publication Ethics (COPE) http://publicationethics.org/ to deal with acts of misconduct. Using this principles we investigate allegations of misconduct and ensure the integrity of research.