We describe algorithmic techniques and data structures that have been proposed to solve variants of the set union problem in which it is possible to backtrack through one or more of the most recents unions. Their discovery required a new set of algorithmic tools that have proved useful in other areas as well. An attempt is made to provide an unifying theoretical framework for this growing body of algorithms.

Backtracking (Invited Paper)

APOSTOLICO, ALBERTO;
1999

Abstract

We describe algorithmic techniques and data structures that have been proposed to solve variants of the set union problem in which it is possible to backtrack through one or more of the most recents unions. Their discovery required a new set of algorithmic tools that have proved useful in other areas as well. An attempt is made to provide an unifying theoretical framework for this growing body of algorithms.
1999
Wiley Encyclopedia of Electrical and ElectronicsEngineering
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

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/11577/161307
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
  • OpenAlex ND
social impact