Abstract. The need to determine pseudoperipheral vertices arises from several graph-theoretical approaches for ordering sparse matrix equations. The results of two algorithms for finding such vertices
Single-source shortest path (SSSP) discovery, one of a shortest path problem in algorithmic graph theory, is a combinatorial optimization problem. Most propositions solving the SSSP problem rely on Di
