Online
10503 days on xHamster
49399M profile views
25708K subscribers
82229 comments left

Updating distances in dynamic graphs

The values for modulus of rupture and thermal conductivity averaged 81 MN/m2 and 0.494 W/mo K. The refractoriness of all the samples were 1300o C and this showed that they could be used as insulating materials. Agha O A (1998) Testing of local refractory clay for producing furnace lining bricks. The values for specific gravity, bulk density, solid density and apparent porosity averaged 2.75, 2.04 g/cm3 , 3.18 g/cm3 , and 13% respectively and they were within the internationally accepted range. The values for linear shrinkage, permeability to air and thermal shock averaged 8.57% 69.4, and 29 respectively and these also were within the accepted limits. We experimentally evaluate our algorithms using eleven real-world large graphs and confirm the effectiveness and efficiency of our approach.

Due to the fact that many applications such as social network link analysis with the existence of inactive users need to handle failed links or nodes, decremental computation and maintenance for graphs is considered a challenging problem.IJERA MENU CALL FOR PAPER PAPER SUBMISSION WHY CHOOSE IJERA AUTHOR INSTRUCTIONS STATISTICS UNIVERSITY AFFILIATES CHECK PAPER STATUS FAQ IJERA CONTENTS CURRENT ISSUE IJERA ARCHIVE SPECIAL ISSUE CALL FOR CONFERENCE UPCOMING CONFERENCE SPECIAL ISSUE ARCHIVE DOWNLOADS MODEL PAPER COPY RIGHT FORM COPYRIGHT INFRINGEMENT JOURNAL ETHICS OPEN ACCESS OPEN ACCESS Abstract: Clay deposits in the Federal Capital Territory of Abuja were investigated with a view to categorizing them in order to determine their suitability as insulating refractory material. The samples were collected from three different locations in the territory, namely Sheda, Abaji and Karimu, and labeled A, B, and C. To address this problem, dynamic algorithm that computes the shortest-path in response to updates is in demand.In this paper, we focus on dynamic algorithms for shortest point-to-point paths computation in directed graphs with positive edge weights.

Please or register to post comments
If spammers comment on your content, only you can see and manage such comments Delete all
A number of indexing methods have been proposed to answer distance queries in static graphs. Unfortunately, there is little work on answering such queries for dynamic graphs. In this paper, we focus on the problem of computing the shortest path distance in dynamic graphs, particularly on decremental updates i.e. edge. 
09-Oct-2018 07:14
Reply
E. W. DijkstraA note on two problems in connexion with graphs. Numerische Mathematik, 1 1959, pp. 269-271. 6. S. Even, H. GazitUpdating distances in dynamic graphs. Methods of Operations Research, 49 1985, pp. 371-387. 7. D. FrigioniSemidynamic algorithms for maintaining single-source shortest path trees. 
09-Oct-2018 07:19
Reply

Updating distances in dynamic graphs introduction

Updating distances in dynamic graphs

Recent posts