TU Wien:Networks: Design and Analysis VU (Sinnl)/exam summer term 2018

Six exercise each worth 10 points but you only needed to do five so one can be skipped.

First: Strong Structural Balance of nodes on a given graph with strong/weak ties

Second: Page Rank algorithm with five nodes and needed to calcualte values after two iterations

Third: Social cost of a traffic example (exactely the one of the slides)

Fourth: Nash equilibria search for a two player game with pure and mixed strategies

Five: Linear Program for the Degree problem in Steiner trees

Six: Theory questions about: bids, structural balance properties, local bridge definition, submodularity in functions, agglomarative graph partitioning