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;
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11588/172351
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact