Linked Data Explorerhttp://worldcat.org/entity/work/id/18209226
A Tight Amortized Bound for Path Reversal
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).
Open All Close All
http://schema.org/about
- http://experiment.worldcat.org/entity/work/data/18209226#Topic/set_theory
- http://experiment.worldcat.org/entity/work/data/18209226#Topic/operations_research
- http://experiment.worldcat.org/entity/work/data/18209226#Topic/paths
- http://experiment.worldcat.org/entity/work/data/18209226#Topic/amortization
- http://experiment.worldcat.org/entity/work/data/18209226#Topic/reversible
- http://experiment.worldcat.org/entity/work/data/18209226#Topic/tightness
- http://experiment.worldcat.org/entity/work/data/18209226#Topic/algorithms
- http://experiment.worldcat.org/entity/work/data/18209226#Topic/costs
http://schema.org/description
- "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)."@en
http://schema.org/name
- "A Tight Amortized Bound for Path Reversal"@en