Traffic Control Problems using Graph Connectivity

  • KumarBaruah A
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

In modern day automobile traffic the problem of traffic congestion calls for the design of efficient control strategies. In this paper it is argued that in order to have efficient and systematic solutions to a traffic control problem at an intersection, graph theoretic models of the problem are quite appropriate for its exploitation. Connectivity of compatibility graph of a traffic intersection can be used to study the most efficient route or the traffic control system to direct the traffic flow to its maximum capacity using the minimum number of edges or the minimum number of vertices. This result has got application in traffic control problems at an arbitrary intersection so as to minimize the waiting time of the traffic participants and the cost of locating the sensors in order to collect traffic data.

Cite

CITATION STYLE

APA

KumarBaruah, A. (2014). Traffic Control Problems using Graph Connectivity. International Journal of Computer Applications, 86(11), 1–3. https://doi.org/10.5120/15026-3342

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free