We provide a formal mathematical definition of the Shortest Paths for All Flows (SP-AF) problem and provide many efficient algorithms. The SP-AF problem combines the well known Shortest Paths (SP) and Bottleneck Paths (BP) problems, and can be solved by utilising matrix multiplication. Thus in our research of the SP-AF problem, we also make a series of contributions to the underlying topics of ...

A method to find low energy paths in macromolecules is described. It can be applied either to determine paths between two given energy minimum conformations, or to explore low energy paths departing from one energy minimized conformation. The principle of the method consists in carrying out energy minimizations or molecular dynamics simulations with root mean square distance constraints with re...

Gaining complete understanding of the active services and open communication paths is often difficult because of the rapidly expanding complexity of those services and their wide-ranging functions. Furthermore, the IT administrators of hand-designed systems often lack ways to identify and close unnecessary services and communication pathways. In this paper, firstly we propose an automated appro...

During recent years, many distance teaching as well as residential institutions have started to experiment with mobile learning through pilot projects as part of their e-learning and technology enhanced learning environments. Mobile learning should not be regarded as a medium for distance learning. However, because of the similar affordances of distance learning technologies and online and mobi...

Finding shortest paths and shortest distances between points on a surface S in three-dimensional space is a well-studied problem in differential geometry and computational geometry. The shortest path between two points on S is denoted a geodesic path on the surface and the shortest distance between two points on S is denoted a geodesic distance. In this survey, we consider the case where a disc...

Distance-based indices, including closeness centrality, average path length, eccentricity and average eccentricity, are important tools for network analysis. In these indices, the distance between two vertices is measured by the size of shortest paths between them. However, this measure has shortcomings. A well-studied shortcoming is that extending it to disconnected graphs (and also directed g...