Meldable RAM priority queues and minimum directed spanning trees.
Ran MendelsonMikkel ThorupUri ZwickPublished in: SODA (2004)
Keyphrases
- spanning tree
- edge disjoint
- priority queue
- minimum cost
- minimum spanning tree
- minimum spanning trees
- total length
- priority scheduling
- undirected graph
- arrival processes
- minimum total cost
- depth first search
- waiting times
- higher priority
- finite capacity
- weighted graph
- design considerations
- np hard
- edge weights
- processor sharing