Publication:4875168
From MaRDI portal
zbMath0847.68037MaRDI QIDQ4875168
Publication date: 16 June 1996
Related Items
Cascade heap: towards time-optimal extractions, Two-agent scheduling on uniform parallel machines with min-max criteria, Two new methods for constructing double-ended priority queues from priority queues, Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic, Two-tier relaxed heaps, Reflected min-Max heaps, Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates, A Survey on Priority Queues, Dynamically Maintaining Shortest Path Trees under Batches of Updates, Worst-Case Optimal Priority Queues via Extended Regular Counters, Hollow Heaps