Routing between Visible Vertices in Constrained Theta Graphs

Rodriguez, Jonathan


  • Routing is the process of sending a message from a source vertex to a destination vertex in a network. When we have complete knowledge of the graph in advance, there are many algorithms that find the optimal path (e.g. Dijkstra, Bellman-Ford). It is not always viable, however, to know the whole network. For example, the network could be incredibly large, or the devices could be moving. Constantly ... read more
This object is in collection Creator department Thesis Type Subject Genre Permanent URL
To Cite:
TARC Citation Guide    EndNote
Detailed Rights