An Algorithm for Ranking Loopless Paths (1999)
| Citations: | 6 - 2 self |
BibTeX
@MISC{Martins99analgorithm,
author = {Ernesto de Queiros Vieira Martins and Ernesto Queir and Jose Luis Esteves dos Santos and Vieira Martins and Marta Margarida and Marta Margarida Braz Pascoal},
title = {An Algorithm for Ranking Loopless Paths},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
: In this paper an algorithm for the ranking of loopless paths problem is proposed which is valid for directed and undirected networks. Despite its theoretical computational complexity be an open problem yet, the algorithm appears to perform well in practice as the reported comparative computational experiments allow us to conclude. This conclusion is reinforced with some results obtained with larger networks; more than 500; 000 loopless paths were ranked in 10; 000 nodes and 100; 000 arcs euclidian networks in about 0:35 seconds of CPU execution time when all the arcs are undirected and in about 0:15 seconds for directed euclidian networks, using a server with 128 Mbytes of RAM and a 275 MHz processor running DEC Unix 3.2. Keywords: path, loopless path, path distance, paths ranking, network. 1 Introduction Let (N ,A) denote a given network, where N = fv 1 ; : : : ; v n g is a finite set whose elements are called nodes and A = fa 1 ; : : : ; am g is a proper subset of N \The...
