The week's pick
Random Articles
Reseach Article
Clique Matrix of a Graph in Traffic Control Problems
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 53 - Number 6 |
| Year of Publication: 2012 |
| Authors: Arun Kumar Baruah, Niky Baruah |
10.5120/8427-2194
|
Arun Kumar Baruah, Niky Baruah . Clique Matrix of a Graph in Traffic Control Problems. International Journal of Computer Applications. 53, 6 ( September 2012), 41-45. DOI=10.5120/8427-2194
Abstract
Clique matrix can be used as a graph theoretic tool to study traffic control problem at an intersection. A traffic control problem can be efficiently modelled as a graph where the nodes represent the traffic streams and the edges represent the relationship among the streams. The matrix representation of the control problem is used for phasing of signal groups and thus providing a solution to the control problem. Clique of a graph is defined as maximal complete subgraph and clique matrix of a graph is defined as a generalization of the incidence matrix where the columns correspond to the number of cliques and the rows correspond to the number of vertices of the graph.
References
- Gazis, D. C. , 1970, Traffic Science, John Wiley & Sons, New York.
- Gazis, D. C. , 2002, Traffic Theory, Kluwer Academic Publishers, London.
- Guberinic, S. , Senborn, G. , Lazic, B. , 2008, Optimal Traffic Control : Urban Intersection, CRC Press.
- Review of Road Traffic Control Strategies : Proceeding of the IEEE, Vol. 91, No. 12, December 2003.
- Barber, D. , 2008, Clique Matrices for Statistical Graph Decomposition and Parameterising Restricted Positive Definite Matrices, Uncertainity in Artificial Intelligence.
- Deo, N. , 2002, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall of India.
- Kumar, A. , Athisayanathan, S. , Antonysamy, A. , 2010, Algorithm to Find All Cliques in a Graph, International Journal of Advanced Networking and Applications, Vol. 02, Issue 02, p. 597-601.
- Augustson, J . G. ,. Minker, J. , 1970, An analysis of some graph theoretical cluster techniques, Journal of ACM, Vol. 17, No. 4, p. 571-588.
- Mitten, L. G. , Branch and Bound Methods : General Formulation and Properties, 1970, Opns. Res. , Vol. 18, p. 24-34
- Coen Bron and Joep Kerboscht, 1937, Finding All Cliques of an Undirected Graph[H], Communications of the ACM, Vol. 16, No. 9, p. 575 - 580.
- Baruah, A. K. , Baruah, N. , 2012, Signal Groups of Compatible Graph in Traffic Control Problems, International Journal of Advanced Networking and Applications, Vol. 04, Issue 01, p. 1473-1480.
- Chartrand, G. , 1977, Introductory Graph Theory, Dover Publishers, Inc. , New York.
- Roberts, F. S. , Graph Theory and Its Application to Social Science, 1978, Regional Conference Series in Applied Mathematics.
Index Terms
Keywords