The optimal route search in Bengaluru city transport using Hamilton circuit algorithm
Traffic congestion is a common transportation issue all over the globe, especially in India's large cities. One of the primary causes of traffic congestion is the sheer volume of private vehicles that travel on city streets and the extensive use of public transportation. The lack of additional...
Main Authors: | Parkavi S, Parthiban A |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2025-02-01
|
Series: | Heliyon |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2405844025008990 |
Similar Items
-
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
by: Suliman Khan, et al.
Published: (2021-02-01) -
A note on hamiltonicity conditions of the coprime and non-coprime graphs of a finite group
by: Muhammad Nurul Huda
Published: (2024-07-01) -
Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs
by: Li Binlong, et al.
Published: (2016-11-01) -
On coefficients of circuit polynomials and characteristic polynomials
by: E. J. Farrell
Published: (1985-01-01) -
Torus–Connected Cycles: A Simple and Scalable Topology for Interconnection Networks
by: Bossard Antoine, et al.
Published: (2015-12-01)