Log In Sign Up

Fast DecreaseKey Heaps with worst case variants

by   Vladan Majerech, et al.

In the paper "Fast Fibonacci heaps with worst case extensions" we have described heaps with both Meld, DecreaseKey and DecreaseKey interfaces, allowing operations with guaranted worst case assymptotically optimal times. The paper was intended to concentrate on DecreaseKey interface, but it could be hard to separate the two described data structures without carefull reading. Current paper's goal is not to invent a novel data structure, but to describe the rather easy DecreaseKey version in hopefully readable form. The paper is intended not to require references to other papers.


page 1

page 2

page 3

page 4


Fast Fibonacci heaps with worst case extensions

We are concentrating on reducing overhead of heaps based on comparisons ...

Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs (Extended version)

Answering connectivity queries is fundamental to fully dynamic graphs wh...

A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching

Many dynamic graph algorithms have an amortized update time, rather than...

PACER: Peripheral Activity Completion Estimation and Recognition

Embedded peripheral devices such as memories, sensors and communications...

Information carefull worstcase DecreaseKey heaps with simple nonMeld variant

We analyze priority queues including DecreaseKey method in its interface...

Debt Swapping for Risk Mitigation in Financial Networks

We study financial networks where banks are connected by debt contracts....

Commutative Monoid Formalism for Weighted Coupled Cell Networks and Invariant Synchrony Patterns

This paper presents a framework based on matrices of monoids for the stu...