Computer scientists are constantly searching for ways to squeeze ever more bandwidth from communications networks. Now a new approach to understanding a basic concept in graph theory, known as “vertex connectivity,” could ultimately lead to communications protocols — the rules that govern how digital messages are exchanged — that coax as much bandwidth as possible from networks. Mohsen Ghaffari, a graduate student in the Computer Science and Artificial Intelligence Laboratory at MIT, will present a new technique for addressing vertex-connectivity problems at the ACM-SIAM Symposium on Discrete Algorithms in Portland, Ore., in January. Read the whole story on MIT News.
Ghaffari creates new approach to vertex connectivity
January 15, 2014