30 research outputs found
The Logarithmic Funnel Heap: A Statistically Self-Similar Priority Queue
The present work contains the design and analysis of a statistically
self-similar data structure using linear space and supporting the operations,
insert, search, remove, increase-key and decrease-key for a deterministic
priority queue in expected O(1) time. Extract-max runs in O(log N) time. The
depth of the data structure is at most log* N. On the highest level, each
element acts as the entrance of a discrete, log* N-level funnel with a
logarithmically decreasing stem diameter, where the stem diameter denotes a
metric for the expected number of items maintained on a given level.Comment: 14 pages, 4 figure
Application of Dijkstra Algorithm to Proposed Tramway of a Potential World Class University
Nowadays, the development of âsmart citiesâ with a high level of quality of life is becoming a prior challenge to be addressed. In this paper, promoting the model shift in railway transportation using tram network towards more reliable, greener and in general more sustainable transportation modes in a potential world class university is proposed. âSmart mobilityâ in a smart city will significantly contribute to achieving the goal of a university becoming a world class university. In order to have a regular and reliable rail system on campus, we optimize the route among major stations on campus, using shortest path problem Dijkstra algorithm in conjunction with a computer software called LINDO to arrive at the optimal route. In particular, it is observed that the shortest path from the main entrance gate (Canaan land entrance gate) to the Electrical Engineering Department is of distance 0.805 km
Shortest Path Trajectory System Based on Dijkstra Algorithm
In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. Everybody can travel by different routes to reach a different destination point. This can be time consuming if they do not travel trough the best route. This project aims to determine locations of the node that reflect all the items in the list, build the route by connecting nodes and evaluate the proposed algorithm for the single source shortest path problem. This project includes the modification of main algorithm which has been implemented in the prototype development. This study discussed the emphasis on the single source shortest path at the location of specific studies. The study will produce a decision-makers prototype
Orderly Spanning Trees with Applications
We introduce and study the {\em orderly spanning trees} of plane graphs. This
algorithmic tool generalizes {\em canonical orderings}, which exist only for
triconnected plane graphs. Although not every plane graph admits an orderly
spanning tree, we provide an algorithm to compute an {\em orderly pair} for any
connected planar graph , consisting of a plane graph of , and an
orderly spanning tree of . We also present several applications of orderly
spanning trees: (1) a new constructive proof for Schnyder's Realizer Theorem,
(2) the first area-optimal 2-visibility drawing of , and (3) the best known
encodings of with O(1)-time query support. All algorithms in this paper run
in linear time.Comment: 25 pages, 7 figures, A preliminary version appeared in Proceedings of
the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2001),
Washington D.C., USA, January 7-9, 2001, pp. 506-51
Faster deterministic sorting and priority queues in linear space
The RAM complexity of deterministic linear space sorting of integers in words is improved from to . No better bounds are known for polynomial space. In fact, the techniques give a deterministic linear space priority queue supporting insert and delete in amortized time and find-min in constant time. The priority queue can be implemented using addition, shift, and bit-wise boolean operations