loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)
On a Traffic Control Problem
Las Vegas, Nevada, USA
December 07-December 09
ISBN: 0-7695-2509-1
WEIZHEN GU, Texas State University, San Marcos
XINGDE JIA, Texas State University, San Marcos
A traffic network can be modeled by a digraph, while the traffic sensor location problem can be studied by using a minimum edge control set which is defined as follows. Let G = (V,E) be a digraph. A subset F of the edge set E is called an edge control set of G if every flow of G is completely determined by F. An edge control set F is said to be minimum if |F| is the least cardinality among all edge control sets of G. In this paper an algorithm for constructing a minimum edge control set of any digraph is established.
Citation:
WEIZHEN GU, XINGDE JIA, "On a Traffic Control Problem," ispan, pp.510-515, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.