Abstract: 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.
Publication Year: 2006
Publication Date: 2006-01-18
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 12
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot