University of Cambridge > > Mini Courses in Theoretical Computer Science > Algebraic Routing (Part 3)

Algebraic Routing (Part 3)

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Sam Staton.

It has been known for several decades that shortest-paths algorithms such as those of Bellman-Ford and Dijkstra can be generalized to commutative and idempotent semirings. This course will review the basics of this theory, as well as some further generalizations that go beyond semirings. For the core material I will attempt to condense those parts of the 2001 book

  • Graphes, dioides et semi-anneaux : Nouveaux modèles et algorithmes by Michel Gondran, Michel Minoux

which I have found to be most relevant to network routing. No previous knowledge of the area will be assumed.

This talk is part of the Mini Courses in Theoretical Computer Science series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity