Spelling suggestions: "subject:"flows inn graphs"" "subject:"flows iin graphs""
1 |
Verification of Solutions to the Sensor Location ProblemMay, Chandler 01 May 2011 (has links)
Traffic congestion is a serious problem with large economic and environmental impacts. To reduce congestion (as a city planner) or simply to avoid congested channels (as a road user), one might like to accurately know the flow on roads in the traffic network. This information can be obtained from traffic sensors, devices that can be installed on roads or intersections to measure traffic flow. The sensor location problem is the problem of efficiently locating traffic sensors on intersections such that the flow on the entire network can be extrapolated from the readings of those sensors. I build on current research concerning the sensor location problem to develop conditions on a traffic network and sensor configuration such that the flow can be uniquely extrapolated from the sensors. Specifically, I partition the network by a method described by Morrison and Martonosi (2010) and establish a necessary and sufficient condition for uniquely extrapolatable flow on a part of that network that has certain flow characteristics. I also state a different sufficient but not necessary condition and include a novel proof thereof. Finally, I present several results illustrating the relationship between the inputs to a general network and the flow solution.
|
2 |
Characterizing Forced Communication in NetworksGutekunst, Samuel C 01 January 2014 (has links)
This thesis studies a problem that has been proposed as a novel way to disrupt communication networks: the load maximization problem. The load on a member of a network represents the amount of communication that the member is forced to be involved in. By maximizing the load on an important member of the network, we hope to increase that member's visibility and susceptibility to capture. In this thesis we characterize load as a combinatorial property of graphs and expose possible connections between load and spectral graph theory. We specifically describe the load and how it changes in several canonical classes of graphs and determine the range of values that the load can take on. We also consider a connection between load and liquid paint flow and use this connection to build a heuristic solver for the load maximization problem. We conclude with a detailed discussion of open questions for future work.
|
Page generated in 0.0625 seconds