A quantum algorithm for minimal spanning tree
Quantum computing algorithms are considered for several problems in graph theory. Classical algorithms involve searching over some space for finding the minimal spanning tree problem in a graph. We modify classical Primpsilas algorithm and replace quantum search instead of classical search, of which...
Saved in:
Main Authors: | Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
IEEE
2008
|
Online Access: | http://psasir.upm.edu.my/id/eprint/69245/1/A%20quantum%20algorithm%20for%20minimal%20spanning%20tree.pdf http://psasir.upm.edu.my/id/eprint/69245/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A hybrid architecture approach for quantum algorithms.
by: Aghaei, Mohammad Reza Soltan, et al.
Published: (2009) -
Quantum Processing Framework And Hybrid
Algorithms For Routing Problems
by: Soltan Aghaei, Mohammad Reza
Published: (2010) -
A hybrid algorithm for finding shortest path in network routing.
by: Soltan Aghaei, Mohammad Reza, et al.
Published: (2009) -
Multidimensional minimal spanning tree: the bursa Malaysia
by: Lim San Yee, San Yee, et al.
Published: (2018) -
Minimal spanning tree for 100 companies in Bursa Malaysia
by: Bahaludin, Hafizah, et al.
Published: (2015)