Essays about: "combining SP-graphs"
Found 1 essay containing the words combining SP-graphs.
-
1. Combining unobtainable shortest path graphs for OSPF
University essay from Matematiska institutionenAbstract : The well-known Dijkstra's algorithm uses weights to determine the shortest path. The focus here is instead on the opposite problem, does there exist weights for a certain set of shortest paths? OSPF (Open Shortest Path First) is one of several possible protocols that determines how routers will send data in a network like the internet. READ MORE
Result pages:
1