In this paper, we consider the problem of finding a shortest path from a source node to a fixed target node (SSP) or to all the nodes (SPT) on a directed graph. A family of algorithms which derives from the known auction algorithm is introduced.
A new forward backward Auction algorithm / Festa, Paola; R., Cerulli; G., Raiconi. - (1999), pp. 109-124.
A new forward backward Auction algorithm
FESTA, PAOLA;
1999
Abstract
In this paper, we consider the problem of finding a shortest path from a source node to a fixed target node (SSP) or to all the nodes (SPT) on a directed graph. A family of algorithms which derives from the known auction algorithm is introduced.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.