Sid Ravinutala

Top trading cycle

Wikipedia entry

This is an example of a problem that is solvable using graphs!

I learned this from Sid Ravinutala, a data scientist who works for ID Insight.

Part of the algorithm includes bipartite graphs and their projections to one of the partitions, cycle-finding, and others.

This should go inside Network Analysis Made Simple as one of the case study chapters.