An efficient distributed algorithm for constructing a breadth-first search tree

1989 ◽  
Vol 20 (10) ◽  
pp. 15-30 ◽  
Author(s):  
Jungho Park ◽  
Nobuki Tokura ◽  
Toshimitsu Masuzawa ◽  
Ken'Ichi Hagihara
Keyword(s):  
Distributed Algorithm ◽  
Search Tree ◽  
Breadth First Search

A SELF-STABILIZING DISTRIBUTED ALGORITHM TO CONSTRUCT BFS SPANNING TREES OF A SYMMETRIC GRAPH

1992 ◽  
Vol 02 (02n03) ◽  
pp. 171-179 ◽  
Author(s):  
SUMIT SUR ◽  
PRADIP K. SRIMANI
Keyword(s):  
Distributed Algorithm ◽  
Spanning Tree ◽  
Spanning Trees ◽  
Direct Approach ◽  
Symmetric Graph ◽  
Breadth First Search ◽  
Theoretical Reasoning

We propose a simple and efficient self-stabilizing distributed algorithm to construct the breadth first search (BFS) spanning tree of an arbitrary connected symmetric graph. We develop a completely new direct approach of graph theoretical reasoning to prove the correctness of our algorithm. The approach seems to have potential to have applications in proving correctness of other self-stabilizing algorithms for graph theoretical problems.

scholarly journals A Breadth-first Search Tree Construction for Multiplicative Circulant Graphs

2021 ◽  
Vol 14 (1) ◽  
pp. 248-264
Author(s):  
John Rafael Macalisang Antalan ◽  
Francis Joseph Campena
Keyword(s):  
Spectral Radius ◽  
Average Distance ◽  
Wiener Index ◽  
Search Tree ◽  
Recursive Method ◽  
Breadth First Search ◽  
Circulant Graphs ◽  
Tree Construction

In this paper, we give a recursive method in constructing a breadth-first search tree for multiplicative circulant graphs of order power of odd. We then use the proposed construction in reproving some results concerning multiplicative circulant graph's diameter, average distance and distance spectral radius. We also determine the graph's Wiener index, vertex-forwarding index, and a bound for its edge-forwarding index. Finally, we discuss some possible research works in which the proposed construction can be applied.

scholarly journals Breadth-First Search Multi-Dimensional Binary Search Tree based Algorithms for Structural

2022 ◽  
Author(s):  
Zhifeng Xu
Keyword(s):  
Reliability Index ◽  
Structural Reliability ◽  
Limit State ◽  
Computational Cost ◽  
Search Tree ◽  
Binary Search ◽  
Reliability Estimation ◽  
Binary Search Tree ◽  
Breadth First Search ◽  
Fast Searching

This research proposes a set of novel algorithms for structural reliability estimation based on muti-dimensional binary search tree and breadth-first search, namely the reliability accuracy supervised searching algorithm, the limit-state surface resolution supervised searching algorithm and the reliability index precision supervised fast searching algorithm. The proposed algorithms have the following strengths: 1, all the proposed algorithms have satisfactory computational efficiency by reducing redundant samplings; 2, their computational costs are stable and computable; 3, performance functions of high non-linearity can be will handled; 4, the reliability accuracy supervised searching algorithm can adapt its computational cost according to a prescribed accuracy; 5, the limit-state surface resolution supervised searching algorithm is able to probe sharp changes on limit-state surfaces; 6, the reliability index precision supervised fast searching algorithm computes the reliability index with sufficient precision in a fast way.

Algoritma Perencanaan Jalur Kendaraan Otonom berbasis Hibridisasi Algoritma BFS dan Path Smoothing

2020 ◽  
Vol 8 (1) ◽  
pp. 13-22
Author(s):  
Muhammad Aria
Keyword(s):  
Breadth First Search ◽  
Search Path ◽  
Path Smoothing

Abstrak – Pada penelitian ini dirancang algoritma alternatif untuk perencanaan jalur kendaraan otonom. Algoritma yang diusulkan adalah hibridisasi dari algoritma Breadth First Search (BFS) dan algoritma path smoothing (BFS – path smoothing). Berdasarkan pengamatan dari hasil pengujian, keuntungan dari algoritma BFS adalah dapat memberikan solusi yang menuju solusi optimal, tetapi memiliki kelemahan dari waktu komputasi yang tinggi. Agar diperoleh solusi yang optimal, maka jalur yang dihasilkan oleh algoritma BFS akan diproses lebih lanjut oleh algoritma path smoothing. Walaupun algoritma BFS - path smoothing memiliki waktu komputasi yang tinggi, tetapi untuk tujuan mendapatkan solusi yang optimal, waktu komputasi BFS – path smoothing masih lebih rendah daripada algoritma RRT* untuk mendapatkan solusi yang optimal. Algoritma RRT* adalah salah satu algoritma yang umum digunakan untuk perencanaan jalur pada kendaraan otonom. Proses hibridisasi ini dilakukan dengan cara menjalankan algoritma BFS terlebih dahulu untuk memberikan solusi awal. Solusi awal tersebut kemudian ditingkatkan kualitasnya menggunakan algoritma path smoothing untuk memperoleh solusi yang optimal. Pengujian algoritma BFS-path smoothing ini dilakukan secara simulasi menggunakan beberapa kasus benchmark yang ada, yaitu lingkungan narrow, maze, trap dan clutter. Kriteria optimalitas yang dibandingkan adalah biaya jalur dan waktu komputasi. Pada pengujian, performansi dari algoritma BFS-path smoothing dibandingkan dengan performansi dari algoritma RRT*. Kami menunjukkan bahwa algoritma yang diusulkan dapat menghasilkan output jalur dengan kualitas yang lebih tinggi daripada jalur yang diproduksi oleh RRT*.   Kata Kunci : Beadth First Search, path smoothing, perencanaan jalur, pengujian simulasi, RRT*

Sign in / Sign up

Export Citation Format

Share Document