Major Algorithms-Networks u Advogato(Levien Appleseed(Ziegler and Lausen a MoleTrust(Massa and Avesani TidalTrust(Golbeck) Advogato Attack resistant Maximum network flow based on Ford-Fulkerson Node capacities determined by the distance from the This is a single source, multiple sink problem with capacities on the nodes u Network flow works on a single source single sink problem with capacities on the edges 10/395 9/39 Major Algorithms - Networks  Advogato (Levien)  Appleseed (Ziegler and Lausen)  MoleTrust (Massa and Avesani)  TidalTrust (Golbeck) 10/39 Advogato  Levien 2003  Attack resistant  Maximum network flow based on Ford-Fulkerson  Node capacities determined by the distance from the source  This is a single source, multiple sink problem with capacities on the nodes  Network flow works on a single source single sink problem with capacities on the edges  The graph is transformed