NDLI: Evaluation on Quantum Computation and Classic Parallel Approaches for Finding Estimation of the Length of Shortest Path in a Weighted Graph

Content Provider	IEEE Xplore Digital Library
Author	Emami, M.S. Fattahi, M.R. Keshmiri, H.
Copyright Year	2008
Description	Author affiliation: Comput. Eng. Dept., Islamic Azad Univ., Roudehen (Emami, M.S.)
Abstract	In this paper we evaluate our presented Quantum Approach for finding the Estimation of the Length of the Shortest Path in a Connected Weighted Graph which is achieved with a polynomial time complexity about O(n) and as a result of evaluation we show that the Probability of Success of our presented Quantum Approach is increased if the Standard Deviation of the Length of all possible paths between Source and Target vertices is increased also we show that if the Standard Deviation is low nevertheless our Quantum Computation Approach is satisfactory and even the standard deviation is exactly zero the probability of Success of our Quantum Approach is not only zero but also is %100. Also we present a Classic Parallel Approach for finding the Estimation of the Length of the shortest path and then as a comparison between our Quantum Computation and Classic Parallel Approaches we show that even by applying the Classic Parallel Approach the problem can be solved with time complexity about O(log(2n -1)).
Starting Page	47
Ending Page	54
File Size	320421
Page Count	8
File Format	PDF
ISBN	9780769531311
DOI	10.1109/ICIS.2008.73
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-05-14
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Quantum computing Concurrent computing Physics computing Polynomials Geophysics computing Routing Computer networks Data models Parallel algorithms Information science Shortest Path Quantum Computation Weighted Graph
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

The Shortest Path Parallel Algorithm on Single Source Weighted Multi-level Graph

Finding the k shortest paths in parallel (2000).

Finding the k shortest paths in parallel.

A Parallel Genetic Algorithm for Shortest Path Routing Problem

Serial-parallel tradeoff analysis of all-pairs shortest path algorithms in reconfigurable computing

A new distributed shortest path algorithm for hierarchically clustered data networks

A Coarse-Grained Parallel Genetic Algorithm with Migration for Shortest Path Routing Problem

Concurrent Parallel Shortest Path Computation (2006)

Efficient parallel algorithms for computing all pair shortest paths in directed graphs

Evaluation on Quantum Computation and Classic Parallel Approaches for Finding Estimation of the Length of Shortest Path in a Weighted Graph

Similar Documents

The Shortest Path Parallel Algorithm on Single Source Weighted Multi-level Graph

Finding the k shortest paths in parallel (2000).

Finding the k shortest paths in parallel.

A Parallel Genetic Algorithm for Shortest Path Routing Problem

Serial-parallel tradeoff analysis of all-pairs shortest path algorithms in reconfigurable computing

A new distributed shortest path algorithm for hierarchically clustered data networks

A Coarse-Grained Parallel Genetic Algorithm with Migration for Shortest Path Routing Problem

Concurrent Parallel Shortest Path Computation (2006)

Efficient parallel algorithms for computing all pair shortest paths in directed graphs

Evaluation on Quantum Computation and Classic Parallel Approaches for Finding Estimation of the Length of Shortest Path in a Weighted Graph