Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP
View through CrossRef
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-case time, insert, meld and decrease-key require O(1) amortized time, and delete-min requires O( log n) amortized time. Our structure is simple and promises an efficient practical behavior when compared to other known Fibonacci-like heaps. The main idea behind our construction is to propagate rank updates instead of performing cascaded cuts following a decrease-key operation, allowing for a relaxed structure.
Title: THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP
Description:
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps.
Namely, find-min requires O(1) worst-case time, insert, meld and decrease-key require O(1) amortized time, and delete-min requires O( log n) amortized time.
Our structure is simple and promises an efficient practical behavior when compared to other known Fibonacci-like heaps.
The main idea behind our construction is to propagate rank updates instead of performing cascaded cuts following a decrease-key operation, allowing for a relaxed structure.
Related Results
Kajian Morfisme Untuk Variasi Kurva Dense Fibonacci Word
Kajian Morfisme Untuk Variasi Kurva Dense Fibonacci Word
The Fibonacci word is one example of a fractal object. The fractal Fibonacci word has the property of being similar to curves with curves. The curve Fibonacci word generated based ...
Some Properties of the Fibonacci Sequence
Some Properties of the Fibonacci Sequence
The purposes of this paper are; (a) to develop a relationship between subscripts of the symbols of Fibonacci and Lucas numbers and the numbers themselves; (b) to develop relationsh...
On parametric types of Apostol Bernoulli-Fibonacci, Apostol Euler-Fibonacci, and Apostol Genocchi-Fibonacci polynomials via Golden calculus
On parametric types of Apostol Bernoulli-Fibonacci, Apostol Euler-Fibonacci, and Apostol Genocchi-Fibonacci polynomials via Golden calculus
<abstract><p>This paper aims to give generating functions for the new family of polynomials, which are called parametric types of the Apostol Bernoulli-Fibonacci, the A...
Fibonacci Prime Labelling on the Class of Flower Graphs
Fibonacci Prime Labelling on the Class of Flower Graphs
Graph labeling is one of the significant topics in graph theory. One of its interesting variants is Fibonacci prime labeling, a special type of labeling that assigns Fibonacci numb...
DEVELOPMENT OF A TECHNOLOGICAL SCHEME AND JUSTIFICATION OF ALFALFA SEED CLEANING PARAMETERS
DEVELOPMENT OF A TECHNOLOGICAL SCHEME AND JUSTIFICATION OF ALFALFA SEED CLEANING PARAMETERS
Despite the high effectiveness of chemical preparations against weeds, this fight begins with the preparation of seed material on seed cleaning lines. An urgent problem in cleaning...
Work Values
Work Values
Research has identified TV series and, also more recently social media, as different actors in vocational socialization, providing individuals with career-related information (Levi...
Beauty of Plants and Flowers Obeys Fibonacci Sequences
Beauty of Plants and Flowers Obeys Fibonacci Sequences
The aim of the study is to test the hypothesis that plants or flowers exhibiting Fibonacci sequences with larger numbers possess greater aesthetic beauty. As the number of Fibonacc...
Exploring fibonacci cordiality in corona graphs
Exploring fibonacci cordiality in corona graphs
A Fibonacci cordial (FC) labeling of a graph G is an injective function f : V(G) → {F0, F1, …, Fn}, where Fi is the ith Fibonacci number, such that the induced edge labeling f*(uv)...