Search Results - some ((((graph algorithm) OR (path algorithm))) OR (tree algorithm))

Search alternatives:

Refine Results
  1. 1
    A hybrid algorithm for finding shortest path in network routing.

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…Classical algorithms have been used to search over some space for finding the shortest paths problem between two points in a network and a minimal weight spanning tree for routing. …”
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Spanning Tree Transformation of Connected Graph into Single-Row Network

    Spanning Tree Transformation of Connected Graph into Single-Row Network by Loh, Ser Lee, Salleh, Shaharuddin, Sarmin, Nor Haniza

    Published 2010
    “…Path-Growing Tree-Forming algorithm applied with Vertex-Prioritized is contained in the model to produce the spanning tree from the connected graph. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    Quantum Processing Framework And Hybrid Algorithms For Routing Problems

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…Another quantum algorithm for a minimum weight spanning tree in the graph was also designed. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs

    A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs by Qureshi, M.A., Hassan, M.F., Safdar, S., Akhbar, R.

    Published 2010
    “…The algorithm completes its execution in O(|E|) for all graphs except few in which longer path (in terms of number of edges) from source to some node makes it best selection for that node.…”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    A quantum algorithm for minimal spanning tree

    A quantum algorithm for minimal spanning tree by Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2008
    “…Classical algorithms involve searching over some space for finding the minimal spanning tree problem in a graph. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop

    Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop by Mohd Yakop, Mohammad Arsyad

    Published 2017
    “…The Directed Acyclic Graph in High Dimensional Dataset Mining (DAGHDDM) is a graph-based mining algorithm that represents itemsets in complete graph before FIM takes place. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    On some packing and partition problems in geometric graphs

    On some packing and partition problems in geometric graphs by Trao, Hazim Michman

    Published 2018
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Test case minimization applying firefly algorithm

    Test case minimization applying firefly algorithm by Hashim, Nor Laily, Dawood, Yasir Salman

    Published 2018
    “…The proposed test case minimization method has the following steps: provide weight to the paths, calculate path coverage for each path, transform an immediate graph into an adjacency matrix, which later is used to apply firefly algorithm and generate optimal test cases. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm

    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

    Published 2023
    “…Finally, the simulation was conducted by implementing a random algorithm to verify the proposed GA in terms of the mobile robot's minimum and maximum path lengths. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia

    Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia by Ahmad, Ab. Rahman, Zenon , Nasaruddin, Hassan, Haswadi

    Published 2005
    “…The shortest path is a part of the subject in the graph theory in the field of operational research. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  11. 11
    Utilization of Tabu search heuristic rules in sampling-based motion planning

    Utilization of Tabu search heuristic rules in sampling-based motion planning by Khaksar W., Hong T.S., Sahari K.S.M., Khaksar M.

    Published 2023
    “…We also compare the performance of the algorithm with some of the well-known path planning approaches, including Bug1, Bug2, PRM, RRT and the Visibility Graph. …”
    Conference Paper
    Save to List
    Saved in:
  12. 12
    Global Mobile Robot Path Planning using Laser Simulator

    Global Mobile Robot Path Planning using Laser Simulator by Ali, Mohammed A. H., Wan Azhar, Wan Yusoff, Zamzuri, Hamedon, Zulkifli, Md. Yusof, Musa, Mailah

    Published 2017
    “…From the results, the laser simulator has advantages in computational time and low collision possibility in comparison with A* algorithm while the path cost of laser simulator is always greater than path cost of A* algorithm.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks

    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks by Chien, Stephen Lim Een, Raja Maamor Shah, Raja Noor Farah Azura, Othman, Mohamed

    Published 2016
    “…Furthermore, the ‘snowflake’ geometrical representation was proposed to illustrate the connectivity of nodes in CHR6o3 as well as to aid the proving of some properties involving its Hamiltonicity. The results of this research are important in developing a routing algorithm for CHR6o3.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Dijkstra’s algorithm in Product Searching System (ProSearch) / Nur Hasni Nasrudin ... [et al.]

    Dijkstra’s algorithm in Product Searching System (ProSearch) / Nur Hasni Nasrudin ... [et al.] by Nasrudin, Nur Hasni, Nasaruddin, Siti Hajar, Syed Abdul Halim, Syarifah Syafiqah Wafa, Ahmad Junid, Rosida

    Published 2015
    “…ProSearch is a system that is developed by applying a graph search algorithm called Dijkstra Algorithm so as to find and identify the shortest path to reach the product. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points

    An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points by Ghaleb, Mukhtar, K. Subramaniam, Shamala, Ghaleb, Safwan Mahmood Yahya

    Published 2019
    “…The algorithm is designed to consider the ME’s tour length and the shortest path tree (SPT) jointly. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Research on risk detection of autonomous vehicle based on rapidly-exploring random tree

    Research on risk detection of autonomous vehicle based on rapidly-exploring random tree by Yincong Ma, Lim, Kit Guan, Tan, Min Keng, Sin, Helen Ee Chuo, Ali Farzamnia, Tze, Kenneth Kin Teo

    Published 2023
    “…Although it has been applied in many fields, there are still some problems, such as low efficiency of path planning and collision risk during driving. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network

    Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network by Qasem, Yaaqob Ali Ahmed

    Published 2010
    “…This algorithm looks for a short path from the subscriber station (SS) node to BS, while the optimal path is achieved when the whole path has the lowest EbMR. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan

    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

    Published 2017
    “…After reviewing various algorithms, it was decided to apply de Bruijn graphs and Eulerian circuits that are based on graph theory. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Communication in Chordal Ring Networks

    Communication in Chordal Ring Networks by Matroud, Atheer Abbas

    Published 2006
    “…Based on the existing results in [61] done by Narayanan and Opatrny, we propose a new algorithm for some families of chordal ring of degree six graphs. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Redesign the 4:2 compressor for partial product reduction

    Redesign the 4:2 compressor for partial product reduction by Hussin, R., Ali Yeon, Md Shakaff, Idris, N., Zaliman, Sauli, Ismail, R.C., Kamarudin, A.

    Published 2009
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: