Jul 2026· International Journal of Interactive Mobile Technologies (ijim)· 0 citations· 28 references
Abstract
This paper presents a comparative analysis of two variants of a classical algorithm for finding the shortest path in a connected graph. The first variant uses an adjacency matrix (AM) to verify the existence of an edge (arc) between two vertices, while the second variant performs the same verification using an adjacency list (AL). The objective of this study is to examine how graph density affects the performance of the two algorithmic modifications depending on the data structure used. A total of 95 graphs were analyzed, grouped into five sets from 100 to 500 in increments of 100. For each group, 19 graphs were generated with densities ranging from 5% to 95% in increments of 5%. The methodology includes analyzing the number of iterations, assignments, and comparisons executed by the algorithms for all graphs. The initial hypothesis assumed that the total number of operations would always be lower when using an AL instead of an adjacency matrix, regardless of graph density. The results demonstrate that this assumption is incorrect: for densities above 82%, the total number of operations is lower when using an adjacency matrix, whereas the AL is more efficient for densities below 82%, with its efficiency increasing as density decreases. These findings are particularly important for mobile technologies, as they support the design of more efficient pathfinding solutions that optimize performance and energy consumption in mobile applications.
The ‘divide and conquer’ paradigm proves to be one of the most frequently used techniques for dealing with the complexities of graph-related problems. Therefore, it is of great importance to measure the tendency of a vertex to be critical and its susceptibility in a graph. The criticality of a vertex is often analysed in terms of its strength. Removing a highly critical vertex from a graph modelling a network may introduce vulnerability into the system represented by the graph. Minimizing the vulnerability of such a network without affecting its fundamental structure, thereby improving the stability of the graph, is the primary objective of the article. To achieve this, certain properties of Euler graphs are analysed in terms of vertex strength, and a method is presented for determining all possible constructions of Euler graphs corresponding to different integer partitions. The parts of a partition represent the vertex strengths, and their sum corresponds to the total vertex strength of the graph. Various connectivity indices are employed to validate the proposed constructions. Furthermore, their interrelationships and potential real-life applications are also discussed. It is evident from the constructions that they may play a vital role in developing network deception technology to protect digital assets, as each partition of the network generates a distinct network.
Saifur Rahman, Raju Doley· Acta Universitatis Sapientia...· 0 citations
Centroids are used to compute an arbitrary number of simple paths with some important benefits: the expansion of a single centroid delivers an arbitrary number of paths; only a single Dijk-stra search is required to complete the task; the same algorithm can be easily coupled with heuristics that improve search efficiency.
This study explores the spectral characteristics and energy distributions associated with selected graph operations derived from the first Zagreb, second Zagreb, and sum-connectivity matrices to contribute to understanding how algebraic operations induce spectral energy shifts analogous to perturbations in physical or molecular graph systems.
S. Sripriya, A. Anuradha· Baghdad Science Journal· 0 citations
The reliability of a network can be increased by removing some unwanted vertices and edges from the network by using the formulas provided here for several vertex and edge types.
Aysun Yurttas Gunes, Hacer Özden Ayna, Ismail Naci Cangül· Journal of new theory· 0 citations
Comparative analysis against A* search Algorithm, ALT, ALT (A* search Landmarks and Triangle inequality), and Arc Flags algorithms demonstrated that Dijkstra consistently achieved faster computation times, lower memory overhead, and higher accuracy in path selection, resulting in significant reductions in delivery and planning time.
O. Uchechi, Dennis Mary Chinonye, Oparauwah Nnaemeka Macdonald· International journal of res...· 0 citations
The E2 Algorithm for constructing the Hamiltonian cycle in an arbitrary graph without edges’ weights is proposed and whether some general graphs are Hamiltonian is shown, to prove the correctness of the method.
Fatih Okumuş, A. Karadoğan· Fırat Üniversitesi Mühendisl...· 0 citations