Now showing items 1-5 of 5

    • On The Circuit Diameters of Some Combinatorial Polytopes 

      Kafer, Sean (University of Waterloo, 2017-09-20)
      The combinatorial diameter of a polytope P is the maximum value of a shortest path between two vertices of P, where the path uses the edges of P only. In contrast to the combinatorial diameter, the circuit diameter of P ...
    • A Primal Dual Algorithm On 2-Steiner Graphs 

      Buckley, Matthew (University of Waterloo, 2018-01-23)
      The Steiner Tree Problem is a fundamental network design problem, where the goal is to connect a subset of terminals of a given network at minimum cost. A major open question regarding this problem, is proving that the ...
    • Stabilizing Weighted Graphs 

      Koh, Zhuan Khye (University of Waterloo, 2017-08-29)
      An edge-weighted graph G = (V,E) is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable graphs play an important role in some interesting game theory ...
    • Technology Diffusion on Spiders 

      Sharma, Charupriya (University of Waterloo, 2017-08-29)
      There has been significant research about cascade effects that occur when information is spread through a network. Most models of such cascade effects are highly-localised, which means that they assume a node’s behaviour ...
    • Vertex Stabilizers for Network Bargaining Games 

      Gerstbrein, Matthew (University of Waterloo, 2022-03-04)
      Network bargaining games form a prominent class of examples of game theory problems defined on graphs, where vertices represent players, and edges represent their possible interactions. An instance of a \emph{network ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages