Publikationsansicht

A Tight Amortized Bound for Path Reversal, (1998)

Abstract
Path reversal is a form of path compression used in a disjoint set union algorithm and a mutual exclusion algorithm. We derive a tight upper bound on the amortized cost of path reversal. (JHD)

Details der Publikation
Mitarbeiter PRINCETON UNIV NJ DEPT OF COMPUTER SCIENCE
Archiv Defense Technical Information Center OAI-PMH Repository (United States)
Keywords OPERATIONS RESEARCH, *SET THEORY, ALGORITHMS, COSTS, PATHS, REVERSIBLE, TIGHTNESS, AMORTIZATION.
Sprache eng