![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tim Griffin
Friday 17 November 2006, 10:00-12:00
Algebraic Routing (Part 3)
- 👤 Speaker: Tim Griffin
- 📅 Date & Time: Friday 17 November 2006, 10:00 - 12:00
- 📍 Venue: Computer Laboratory, Room FW11
Questions? Contact
Sam Staton
Abstract
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.
Series This talk is part of the Mini Courses in Theoretical Computer Science series.
Included in Lists
- All Talks (aka the CURE list)
- All transferable skills in the university: computing
- bld31
- Cambridge talks
- Computer Laboratory, Room FW11
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Mini Courses in Theoretical Computer Science
- Modelling Biology
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.