About Testing the Speed of Calculating the Shortest Route

Details About Testing the Speed of Calculating the Shortest Route About Testing the Speed of Calculating the Shortest Route

2009-03-03

arxiv.org/abs/0903.0578v1

Ann. Univ. Tibiscus, Comp. Sci. Series 6 (2008), 121-126

Computer Science

Discrete Mathematics

6 pages, exposed on the 2nd "European Conference on Computer Science & Applications" - XA2008, Timisoara, Romania

Scientific paper

Applied into a various area of domains, the graph theory and its applications allow the determination of the shortest route. The common algorithm to solve this problem is Bellman-Kalaba, based on the matrix multiplying operation. If the graph is very large (e.g., the dimension of the associated incidence matrix is big) one of the main problems is to reduce the calculus time. This paper presents a testing method able to analyze if an acceleration of the Bellman-Kalaba is possible and able to determine the time efficiency.

Affiliated with

Also associated with

No associations

Rating

About Testing the Speed of Calculating the Shortest Route does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with About Testing the Speed of Calculating the Shortest Route, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and About Testing the Speed of Calculating the Shortest Route will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-653641