Research ArticleOpen accessIn the keywordsAn Empirical Criterion for Transitive ClosureMarius OrlowskiThe paper establishes a simple and computationally economical criterion for determining whether a given adjacency matrix represents a transitive closure or not. The criterion is based on a new iterative method for finding the transitive closure adjacency matrix. This method is equivalent to but computationally more efficient than the traditional Boolean sum of successive powers of the original adjacency matrix … …Journal of Computer Science, Vol. 18, Issue 12 · 23 Dec 2022 · 5,418 accessesView PDFCite
Research ArticleOpen accessIn the abstractBased Approach to Improve the All-Pair Shortest Path ComputationLau Nguyen Dinh, Le Thanh TuanThis paper presents the development of a centralized algorithm for finding the shortest path between all pairs of vertices on a graph, utilizing the basic structure of the Floyd-Warshall sequential algorithm. The proposed algorithm leverages multiple processors to compute the shortest path between all vertex pairs, with one processor taking the central role in data management. This central processor divides … …Journal of Computer Science, Vol. 21, Issue 7 · 30 Jun 2025 · 2,903 accessesView PDFCite
Research ArticleOpen accessIn the abstractCargo Route Optimization Using Shortest Path Algorithms: Runtime and Validity ComparisonDedy Rahman Wijaya, Aqil Athallah, Tiara Nuha Noor’afina et al.The Indonesian logistics industry is facing significant challenges related to inefficiency and irregularity, particularly in the commodity cargo route system. This issue is further exacerbated by the high logistics costs in the country, which currently stands at 23%, higher than that of other countries. To address this issue, this study proposes an implementation and examination of several algorithms Greedy, Best … …Journal of Computer Science, Vol. 19, Issue 11 · 19 Oct 2023 · 6,351 accessesView PDFCite