• Dr. Anirban Chakraborty

In this paper a two-way searching methodology has been proposed, where simultaneously two searching is being carried out, one from Start node to Destination node and other in reverse direction. The proposed methodology is optimal, complete and runs with a complexity of O(nm/2) . The proposed algorithm has successfully been implemented for solution of land acquisition problem, a burning issue of the country now-a-days, where while selection of path in addition to distance, many other influencing parameters been judged. This methodology takes as input a digitized land bank. To evaluate the efficiency, the methodology been compared with many popular graph traversal algorithms.

Two-way searching, influencing parameters, land acquisition problem, digitized map, optimal, complete

"Bi-Directional Routing through low cost regions (BDR) – A Two-way Graph Traversal Methodology", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.10, Issue 8, page no.f474-f483, August-2023, Available :http://www.jetir.org/papers/JETIR2308555.pdf

"Bi-Directional Routing through low cost regions (BDR) – A Two-way Graph Traversal Methodology", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.10, Issue 8, page no. ppf474-f483, August-2023, Available at : http://www.jetir.org/papers/JETIR2308555.pdf