Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

This paper presents a new algorithm for the fast, shared memory multi-core computation of augmented merge trees on triangulations… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

We construct a readable, compact and efficient implementation of Dijkstra’s shortest path algorithm and Fibonacci heaps using… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue) called theFibonacci heap… Expand

Is this relevant?

Highly Cited

1992

Highly Cited

1992

Abstract The goal of this paper is to investigate the area requirements for upward grid drawings of binary trees. First, we show… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heap—a sequence… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, <italic>Fibonacci heaps… Expand

Is this relevant?

Highly Cited

1987

Highly Cited

1987

In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue). Their data structure… Expand

Is this relevant?

Highly Cited

1984

Highly Cited

1984

In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps… Expand

Is this relevant?

Highly Cited

1979

Highly Cited

1979

Some new sequences are introduced which satisfy quadratic recurrence rules similar to those satisfied by the classical Catalan… Expand

Is this relevant?